1.1needham schroeder protocol, subject to offline dictionary PW attack with eavedropping?
1.2BIBA mode. how 2 object write/read each other?
1.3PKI, why periodally issue cerificate revocation list?
1.4 3 main risk for credit card, can 3-D solve?
2 TSS: Y=H(X), Z=SigTSS(Y|t) (Z,t)
2.1 3 conditions make it safe?
2.2 X1---X5 merkle tree, how to make TSS ? how to verify X1 only?
3.1 SSL protocol, A to B: hello. B to A: pkB,session ID. A to B: secret using pkB encryption.
decryption > encryption time. how to prevent exhaustive attack? using client puzzle?
3.2 A-F1-F2-B A-B: IP transport AH. F1-F2: IPs tunnel SEC. packet will be like? in steps?
4 MR1,
4.1 2cent each s=1/200, X?
4.2 why not F(C) but F(signM(C))?
4.3 B check M double spending? M check U?
5 hybrid structure in BLP
1.2BIBA mode. how 2 object write/read each other?
1.3PKI, why periodally issue cerificate revocation list?
1.4 3 main risk for credit card, can 3-D solve?
2 TSS: Y=H(X), Z=SigTSS(Y|t) (Z,t)
2.1 3 conditions make it safe?
2.2 X1---X5 merkle tree, how to make TSS ? how to verify X1 only?
3.1 SSL protocol, A to B: hello. B to A: pkB,session ID. A to B: secret using pkB encryption.
decryption > encryption time. how to prevent exhaustive attack? using client puzzle?
3.2 A-F1-F2-B A-B: IP transport AH. F1-F2: IPs tunnel SEC. packet will be like? in steps?
4 MR1,
4.1 2cent each s=1/200, X?
4.2 why not F(C) but F(signM(C))?
4.3 B check M double spending? M check U?
5 hybrid structure in BLP
