| dc.date.accessioned | 2007-02-20T13:41:48Z | |
| dc.date.accessioned | 2018-11-24T10:25:20Z | |
| dc.date.available | 2007-02-20T13:41:48Z | |
| dc.date.available | 2018-11-24T10:25:20Z | |
| dc.date.issued | 2007-02-16 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/35918 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/35918 | |
| dc.description.abstract | The 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.extent | 98 p. | |
| dc.relation.replaces | http://hdl.handle.net/1721.1/33217 | |
| dc.relation.uri | http://hdl.handle.net/1721.1/33217 | |
| dc.title | Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol | |
