Show simple item record

dc.contributor.advisorNancy Lynch
dc.contributor.authorCanetti, Ran
dc.contributor.authorCheung, Ling
dc.contributor.authorKaynar, Dilsun
dc.contributor.authorLiskov, Moses
dc.contributor.authorLynch, Nancy
dc.contributor.authorPereira, Olivier
dc.contributor.authorSegala, Roberto
dc.contributor.otherTheory of Computation
dc.date.accessioned2007-02-20T13:41:48Z
dc.date.available2007-02-20T13:41:48Z
dc.date.issued2007-02-16
dc.identifier.otherMIT-CSAIL-TR-2007-011
dc.identifier.urihttp://hdl.handle.net/1721.1/35918
dc.description.abstractThe Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on implementation relationships between these levels. We enhance this framework to allow analyzing protocols that use cryptographic primitives. This requires resolving and reconciling issues such as nondeterministic behavior and scheduling, randomness, resource-bounded computation, and computational hardness assumptions. The enhanced framework allows for more rigorous and systematic analysis of cryptographic protocols. To demonstrate the use of this framework, we present an example analysis that we have done for an Oblivious Transfer protocol.
dc.format.extent98 p.
dc.relation.ispartofseriesMassachusetts Institute of Technology Computer Science and Artificial Intelligence Laboratory
dc.relation.replaceshttp://hdl.handle.net/1721.1/33217
dc.relation.urihttp://hdl.handle.net/1721.1/33217
dc.titleUsing Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record