Show simple item record

Task-Structured Probabilistic I/O Automata

dc.date.accessioned2006-03-31T17:51:50Z
dc.date.accessioned2018-11-24T10:24:48Z
dc.date.available2006-03-31T17:51:50Z
dc.date.available2018-11-24T10:24:48Z
dc.date.issued2006-03-31
dc.identifier.urihttp://hdl.handle.net/1721.1/32525
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/32525
dc.description.abstractIn the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These schedulers are too powerful in the setting of securityanalysis, leading to unrealistic adversarial behaviors. Therefore, weintroduce in this paper a novel mechanism of task partitions for PIOAs.This allows us to define partial-information adversaries in a systematicmanner, namely, via sequences of tasks.The resulting task-PIOA framework comes with simple notions of externalbehavior and implementation, and supports simple compositionalityresults. A new type of simulation relation is defined and proven soundwith respect to our notion of implementation. To illustrate the potentialof this framework, we summarize our verification of an ObliviousTransfer protocol, where we combine formal and computational analyses.Finally, we present an extension with extra expressive power, usinglocal schedulers of individual components.
dc.format.extent45 p.
dc.format.extent2404679 bytes
dc.format.extent487620 bytes
dc.language.isoen_US
dc.relation.isreplacedbyhttp://hdl.handle.net/1721.1/33964
dc.relation.urihttp://hdl.handle.net/1721.1/33964
dc.titleTask-Structured Probabilistic I/O Automata


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2006-023.pdf487.6Kbapplication/pdfView/Open
MIT-CSAIL-TR-2006-023.ps2.404Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record