Show simple item record

Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol

dc.date.accessioned2006-03-10T01:22:47Z
dc.date.accessioned2018-11-24T10:24:47Z
dc.date.available2006-03-10T01:22:47Z
dc.date.available2018-11-24T10:24:47Z
dc.date.issued2006-03-08
dc.identifier.urihttp://hdl.handle.net/1721.1/31310
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/31310
dc.description.abstractAbstractThe 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, wepresent an example analysis that we have done for an Oblivious Transfer protocol.
dc.format.extent98 p.
dc.format.extent104102681 bytes
dc.format.extent4467324 bytes
dc.language.isoen_US
dc.relation.isreplacedbyhttp://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

FilesSizeFormatView
MIT-CSAIL-TR-2006-019.pdf4.467Mbapplication/pdfView/Open
MIT-CSAIL-TR-2006-019.ps104.1Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record