| dc.date.accessioned | 2006-06-20T21:18:08Z | |
| dc.date.accessioned | 2018-11-24T10:24:57Z | |
| dc.date.available | 2006-06-20T21:18:08Z | |
| dc.date.available | 2018-11-24T10:24:57Z | |
| dc.date.issued | 2006-06-20 | |
| dc.identifier.citation | June 19, 2006 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/33217 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/33217 | |
| dc.description.abstract | The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation relationships between these levels. We enhance this framework to allow analyzingprotocols that use cryptographic primitives. This requires resolving andreconciling 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.format.extent | 898579 bytes | |
| dc.format.extent | 5581045 bytes | |
| dc.language.iso | en_US | |
| dc.relation.replaces | http://hdl.handle.net/1721.1/31310 | |
| dc.relation.isreplacedby | http://hdl.handle.net/1721.1/35918 | |
| dc.relation.uri | http://hdl.handle.net/1721.1/35918 | |
| dc.relation.uri | http://hdl.handle.net/1721.1/31310 | |
| dc.title | Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol | |
