1. Stanford vs. UC: The Big Game A. Datta, A. Derek, J. C. Mitchell, A. Ramanathan & A. Scedrov August 16, 2005

2. The Problem uSpecifying security of cryptographic primitives and protocols Games: –Between challenger and adversary –Defines specific moves for each player –Not composable UC: –Simulation relation between real protocol and ideal functionality, which is “secure by construction” –Composable uHow are these specification methods related?

3. What is an “ideal” functionality uProposal: Ideal functionality for a primitive should satisfy corresponding game-conditions information- theoretically uIntuition: “secure by construction” uExample: Bit-commitment – two games for hiding and binding properties

4. Impossibility Theorem uIf F is any ideal functionality for bit- commitment, then no real protocol UC- securely realizes F uIntuition: Can construct information- theoretically hiding and binding protocol for BC that does not use TTP uSimilarly, symmetric encryption, group signatures,…

5. Conclusions uBig Game results uDevelop other composable notions of security? Conditional composability as opposed to universal (restricted environments) Year1996199719981999200020012002200320042005 Winner STANFORDUC?

6. Assume UC realization

7. Proof, phase 1 of

8. Proof, phase 2 of