SSL Failing, Sharing, and Scheduling
Download as PPTX, PDF0 likes3,447 views
The document discusses the SSL/TLS handshake protocol, detailing the process involved in securing a channel and verifying server identities, as well as the potential implementation challenges. It also explores memory sharing in Rust programming through examples of unsafe code and threading, demonstrating how shared mutable state can lead to data races. Additionally, the document reflects on scheduling issues and includes various programming insights and thoughts on computer science concepts.
![SSL/TLS Handshake Protocol
Client
Verify Certificate
using KUCA
Hello
Server
KRCA[Server Identity, KUS]
Check identity
matches URL
Generate
random K
EKUS (K)
Secure channel using K
Decrypt
using
KRS
4](https://image.slidesharecdn.com/class10-inked-140227105904-phpapp02/85/SSL-Failing-Sharing-and-Scheduling-5-320.jpg)
![SSL/TLS Handshake Protocol
Client
Verify Certificate
using KUCA
Check identity
matches URL
Generate
random K
Hello
Server
KRCA[Server Identity, KUS]
How did client get KUCA?
EKUS (K)
Secure channel using K
Decrypt
using
KRS
5](https://image.slidesharecdn.com/class10-inked-140227105904-phpapp02/85/SSL-Failing-Sharing-and-Scheduling-6-320.jpg)
![SSL/TLS Handshake Protocol
Client
Verify Certificate
using KUCA
Hello
Server
KRCA[Server Identity, KUS]
Check identity
matches URL
Generate
random K
EKUS (K)
Secure channel using K
Decrypt
using
KRS
7](https://image.slidesharecdn.com/class10-inked-140227105904-phpapp02/85/SSL-Failing-Sharing-and-Scheduling-8-320.jpg)
![static OSStatus
SSLVerifySignedServerKeyExchange(SSLContext *ctx, bool isRsa, SSLBuffer signedParams,
uint8_t *signature, UInt16 signatureLen)
{
OSStatus
err;
SSLBuffer
hashOut, hashCtx, clientRandom, serverRandom;
uint8_t
hashes[SSL_SHA1_DIGEST_LEN + SSL_MD5_DIGEST_LEN];
SSLBuffer
signedHashes;
uint8_t
*dataToSign;
size_t
dataToSignLen;
signedHashes.data = 0;
hashCtx.data = 0;
Apple’s
Implementation
clientRandom.data = ctx->clientRandom;
clientRandom.length = SSL_CLIENT_SRVR_RAND_SIZE;
serverRandom.data = ctx->serverRandom;
serverRandom.length = SSL_CLIENT_SRVR_RAND_SIZE;
…
hashOut.data = hashes + SSL_MD5_DIGEST_LEN;
hashOut.length = SSL_SHA1_DIGEST_LEN;
if ((err = SSLFreeBuffer(&hashCtx)) != 0)
goto fail;
[Link]
8](https://image.slidesharecdn.com/class10-inked-140227105904-phpapp02/85/SSL-Failing-Sharing-and-Scheduling-9-320.jpg)
![dori-mic.org
“If only I had this book when I was
a young student, I might have
done something useful with my
life like discover a new complexity
class instead of dropping out and
wasting my life flipping
pancakes, playing with basic
blocks, and eradicating polo.”
Gill Bates,
Founder of Mic-Soft Corporation
MiniLEGO [FJNNO 2013]](https://image.slidesharecdn.com/class10-inked-140227105904-phpapp02/85/SSL-Failing-Sharing-and-Scheduling-44-320.jpg)
SSL Failing, Sharing, and Scheduling
- 1. Goto Failing, Sharing, and Scheduling Try this now: rust-class.org/ssl.html
- 2. Plan for Today Apple’s SSL Bug Sharing Memory Scheduling 1
- 3. Try this now: rust-class.org/ssl.html 2
- 4. 3
- 5. SSL/TLS Handshake Protocol Client Verify Certificate using KUCA Hello Server KRCA[Server Identity, KUS] Check identity matches URL Generate random K EKUS (K) Secure channel using K Decrypt using KRS 4
- 6. SSL/TLS Handshake Protocol Client Verify Certificate using KUCA Check identity matches URL Generate random K Hello Server KRCA[Server Identity, KUS] How did client get KUCA? EKUS (K) Secure channel using K Decrypt using KRS 5
- 7. 6
- 8. SSL/TLS Handshake Protocol Client Verify Certificate using KUCA Hello Server KRCA[Server Identity, KUS] Check identity matches URL Generate random K EKUS (K) Secure channel using K Decrypt using KRS 7
- 9. static OSStatus SSLVerifySignedServerKeyExchange(SSLContext *ctx, bool isRsa, SSLBuffer signedParams, uint8_t *signature, UInt16 signatureLen) { OSStatus err; SSLBuffer hashOut, hashCtx, clientRandom, serverRandom; uint8_t hashes[SSL_SHA1_DIGEST_LEN + SSL_MD5_DIGEST_LEN]; SSLBuffer signedHashes; uint8_t *dataToSign; size_t dataToSignLen; signedHashes.data = 0; hashCtx.data = 0; Apple’s Implementation clientRandom.data = ctx->clientRandom; clientRandom.length = SSL_CLIENT_SRVR_RAND_SIZE; serverRandom.data = ctx->serverRandom; serverRandom.length = SSL_CLIENT_SRVR_RAND_SIZE; … hashOut.data = hashes + SSL_MD5_DIGEST_LEN; hashOut.length = SSL_SHA1_DIGEST_LEN; if ((err = SSLFreeBuffer(&hashCtx)) != 0) goto fail; [Link] 8
- 10. static OSStatus SSLVerifySignedServerKeyExchange(SSLContext *ctx, bool isRsa, SSLBuffer signedParams, uint8_t *signature, UInt16 signatureLen) { … if ((err = ReadyHash(&SSLHashSHA1, &hashCtx)) != 0) goto fail; if ((err = SSLHashSHA1.update(&hashCtx, &clientRandom)) != 0) goto fail; if ((err = SSLHashSHA1.update(&hashCtx, &serverRandom)) != 0) goto fail; if ((err = SSLHashSHA1.update(&hashCtx, &signedParams)) != 0) goto fail; goto fail; if ((err = SSLHashSHA1.final(&hashCtx, &hashOut)) != 0) goto fail; Apple’s Implementation (cleaned up and excerpted) err = sslRawVerify(ctx, ctx->peerPubKey, dataToSign, dataToSignLen, signature, signatureLen); if(err) { sslErrorLog("SSLDecodeSignedServerKeyExchange: sslRawVerify returned %dn", (int)err); goto fail; } fail: SSLFreeBuffer(&signedHashes); SSLFreeBuffer(&hashCtx); return err; } 9
- 11. … if ((err = SSLHashSHA1.update(&hashCtx, &serverRandom)) != 0) goto fail; if ((err = SSLHashSHA1.update(&hashCtx, &signedParams)) != 0) goto fail; goto fail; if ((err = SSLHashSHA1.final(&hashCtx, &hashOut)) != 0) goto fail; err = sslRawVerify(ctx, ctx->peerPubKey, dataToSign, dataToSignLen, signature, signatureLen); if(err) { sslErrorLog("SSLDecodeSignedServerKeyExchange: sslRawVerify returned %dn", (int)err); goto fail; } fail: SSLFreeBuffer(&signedHashes); Apple’s Implementation SSLFreeBuffer(&hashCtx); (cleaned up and excerpted) return err; } 10
- 12. … if ((err = SSLHashSHA1.update(&hashCtx, &serverRandom)) != 0) goto fail; if ((err = SSLHashSHA1.update(&hashCtx, &signedParams)) != 0) goto fail; goto fail; if ((err = SSLHashSHA1.final(&hashCtx, &hashOut)) != 0) goto fail; How should these kinds of mistakes be prevented? err = sslRawVerify(ctx, ctx->peerPubKey, dataToSign, dataToSignLen, signature, signatureLen); if(err) { sslErrorLog("SSLDecodeSignedServerKeyExchange: sslRawVerify returned %dn", (int)err); goto fail; } fail: SSLFreeBuffer(&signedHashes); SSLFreeBuffer(&hashCtx); return err; } 11
- 13. 12
- 14. Theory Excursion How hard is it for a compiler to provide unreachable code warnings? 13
- 16. Unreachable is Undecidable fn halts(program: &str) { execute(program); println!(“Am I unreachable?”); } Compilers shouldn’t be constrained by theory! Goal is to help programmers Okay for warnings to be unsound and incomplete (even okay for errors!) 15
- 17. My New Theory of Computation Book! 16
- 18. plug book A Tragicomic Tale of Combinatorics and Computability for Curious Children of All Ages Illustrations by Kim Dylla
- 20. Tasks Class 7: fn spawn(f: proc ()) spawn( proc() { println(“Get to work!”); }); Thread Own PC Own stack, registers Safely shared immutable memory Safely independent own memory Task = Thread – unsafe memory sharing or Task = Process + safe memory sharing – cost of OS process 19
- 21. static mut count: uint = 0; fn update_count() { unsafe { count += 1; } } fn main() { for _ in range(0u, 10) { for _ in range(0u, 1000) { update_count(); } } println!("Count: {:}", unsafe { count }); } 20
- 22. static mut count: uint = 0; fn update_count() { unsafe { count += 1; } } fn main() { for _ in range(0u, 10) { for _ in range(0u, 1000) { update_count(); } } println!("Count: {:}", unsafe { count }); } > rustc unsafe1.rs > ./unsafe1 Count: 10000 > ./unsafe1 Count: 10000 > ./unsafe1 Count: 10000 21
- 23. static mut count: uint = 0; fn update_count() { unsafe { count += 1; } } fn main() { for _ in range(0u, 10) { spawn(proc() { for _ in range(0u, 1000) { update_count(); } }); } println!("Count: {:}", unsafe { count }); } > rustc unsafe2.rs > ./unsafe2 Count: 6955 > ./unsafe2 Count: 6473 > ./unsafe2 Count: 6367 > ./unsafe2 Count: 7557 22
- 24. static mut count: uint = 0; fn update_count(id: uint) { unsafe { println!("Before update from {:}: {:}", id, count); count += 1; println!("After update from {:}: {:}", id, count); } } fn main() { for id in range(0u, 10) { spawn(proc() { for _ in range(0u, 1000) { update_count(id); } }); } println!("Count: {:}", unsafe { count }); } 23
- 25. static mut count: uint = 0; > ./unsafe3 Before fn update_count(id: uint) { update from 0: 0 unsafe { Before update from 1: 0 println!("Before updateupdate from 0: 1 After from {:}: {:}", id, count); count += 1; Before update from 0: 1 println!("After update from {:}: {:}", id, count); After update from 0: 2 } } … After update from 2: 81 fn main() { Before update from 0: 81 for id in range(0u, 10) { spawn(proc() { After update from 3: 83 for _ in range(0u, 1000) update from 2: After update from 5: 83 Before { update_count(id); 83 } Before update from 3: 84 }); Before update from 6: 22 } println!("Count: {:}", unsafe { count from 0: 84 After update }); } … 24
- 26. static mut count: uint = 0; fn update_count(id: uint) { unsafe { println!("Before update from {:}: {:}", id, count); count += 1; println!("After update from {:}: {:}", id, count); } } fn main() { for id in range(0u, 10) { spawn(proc() { for _ in range(0u, 1000) { update_count(id); } }); } println!("Count: {:}", unsafe { count }); } … Before update from 5: 6977 Before updCount: 6849 After update from 0: 6867 ate from 7: 6977 After update from 8: 6958 … After update from 1: 9716 Before update from 1: 9716 After update from 1: 9717 Before update from 1: 9717 After update from 1: 9718 > 25
- 27. fn update_count() { unsafe { count += 1; } } How atomic is count += 1? 26
- 28. unsafe2.s __ZN12update_count19h86817af0b0797e96al4v0.0E: .cfi_startproc cmpq %gs:816, %rsp ja LBB0_0 rustc -S unsafe2.rs movabsq $16, %r10 movabsq $0, %r11 callq ___morestack ret LBB0_0: pushq %rbp Ltmp2: .cfi_def_cfa_offset 16 Ltmp3: .cfi_offset %rbp, -16 movq %rsp, %rbp Ltmp4: … 27
- 29. unsafe2.s Ltmp4: .cfi_def_cfa_register %rbp pushq %rax movq __ZN5count19hc6afed277fb1b6c3ah4v0.0E(%rip), %rax addq $1, %rax movq %rax, __ZN5count19hc6afed277fb1b6c3ah4v0.0E(%rip) movq %rdi, -8(%rbp) addq $8, %rsp popq %rbp ret .cfi_endproc 28
- 30. rustc -O fn update_count() { unsafe { count += 1; } } fn main() { for _ in range(0u, 10) { spawn(proc() { for _ in range(0u, 1000) { update_count(); } }); } println!("Count: {:}", …); __ZN4main4anon7expr_fn2agE: .cfi_startproc … pushq %rbp Ltmp15: .cfi_def_cfa_offset 16 Ltmp16: .cfi_offset %rbp, -16 movq %rsp, %rbp } Ltmp17: .cfi_def_cfa_register %rbp addq $1000, __ZN5count19hc6afed277v0.0E(%rip) popq %rbp ret .cfi_endproc > rustc unsafe2.rs > ./unsafe2 Count: 7628 > ./unsafe2 Count: 6672 > rustc -O unsafe2.rs > ./unsafe2 Count: 10000 > ./unsafe2 Count: 10000 > ./unsafe2 Count: 10000 > ./unsafe2 Count: 10000 > ./unsafe2 Count: 9000 29
- 31. ARCs Automatically Reference Counted extra::arc provides: Arc wrapper for shared immutable state MutexArc mutable shared state protected by mutual exclusion RWArc mutable shared state protected by reader-writer lock 30
- 32. Creating an RWArc let counter: RWArc<int> = RWArc::new(0); 31
- 33. RWArc write 32
- 34. 33
- 35. |count: &mut int| fn update_count(counter: RWArc<int>) { counter.write(|count| { *count += 1; }); } 34
- 36. extern mod extra; use extra::arc::RWArc; fn update_count(counter: RWArc<int>) { counter.write(|count| { *count += 1; }); } fn main() { let counter: RWArc<int> = RWArc::new(0); for _ in range(0, 10) { let ccounter = counter.clone(); spawn(proc() { for _ in range(0, 1000) { update_count(ccounter.clone()); } }); } counter.read(|count| { println!("Count: {:d}", *count); }); } 35
- 37. extern mod extra; use extra::arc::RWArc; What is the value printed for Count? fn update_count(counter: RWArc<int>) { counter.write(|count| { *count += 1; }); } fn main() { let counter: RWArc<int> = RWArc::new(0); for _ in range(0, 10) { let ccounter = counter.clone(); spawn(proc() { for _ in range(0, 1000) { update_count(ccounter.clone()); } }); } > ./rwarc1 Count: 1139 > ./rwarc1 Count: 1146 > ./rwarc1 Count: 1158 counter.read(|count| { println!("Count: {:d}", *count); }); } 36
- 38. fn main() { let counter: RWArc<int> = RWArc::new(0); let running: RWArc<int> = RWArc::new(0); for _ in range(0, 10) { let ccounter = counter.clone(); running.write(|n| { *n += 1; }); let crunning = running.clone(); spawn(proc() { for _ in range(0, 100) { update_count(ccounter.clone()); } crunning.write(|n| { *n -= 1; }); }); } while running.read(|n| { *n }) > 0 { ; } counter.read(|count| { println!("Count: {:d}", *count); }); } 37
- 39. Scheduling 38
- 40. Remember from Class 4: 1. How should the supervisor decide which program to run? 2. How long should the alarm clock be set for? 39
- 41. Scheduler Desiderata Go placidly amid the noise and haste, and remember what peace there may be in silence. As far as possible without surrender be on good terms with all persons. Speak your truth quietly and clearly; and listen to others, even the dull and the ignorant; they too have their story. Avoid loud and aggressive persons, they are vexations to the spirit. … Exercise caution in your business affairs; for the world is full of trickery. …And whether or not it is clear to you, no doubt the universe is unfolding as it should…whatever your labors and aspirations, in the noisy confusion of life keep peace with your soul. With all its sham, drudgery, and broken dreams, it is still a beautiful world. Be cheerful. Strive to be happy. Max Ehrmann, “Desiderata” (1927) 40
- 42. How well do traffic lights do? 41
- 43. How well do traffic lights do? 42
- 44. dori-mic.org “If only I had this book when I was a young student, I might have done something useful with my life like discover a new complexity class instead of dropping out and wasting my life flipping pancakes, playing with basic blocks, and eradicating polo.” Gill Bates, Founder of Mic-Soft Corporation MiniLEGO [FJNNO 2013]