Analyzing security protocols using time-bounded task-PIOAs

Ran Canetti, Ling Cheung, Dilsun Kaynar*, Moses Liskov, Nancy Lynch, Olivier Pereira, Roberto Segala

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

30 Scopus citations

Abstract

This paper presents the time-bounded task-PIOA modeling framework, an extension of the probabilistic input/output automata (PIOA) framework that can be used for modeling and verifying security protocols. Time-bounded task-PIOAs can describe probabilistic and nondeterministic behavior, as well as time-bounded computation. Together, these features support modeling of important aspects of security protocols, including secrecy requirements and limitations on the computational power of adversarial parties. They also support security protocol verification using methods that are compatible with less formal approaches used in the computational cryptography research community. We illustrate the use of our framework by outlining a proof of functional correctness and security properties for a well-known oblivious transfer protocol.

Original languageEnglish
Pages (from-to)111-159
Number of pages49
JournalDiscrete Event Dynamic Systems: Theory and Applications
Volume18
Issue number1
DOIs
StatePublished - Mar 2008
Externally publishedYes

Funding

FundersFunder number
DARPA/AFOSR49620-02-1-0325
DFG/NWO-0326227
INRIA ARC
MURI AFOSR-0121277, 2796PO 1-0000243658, -0326277
US Army Research Office19-01-1-0485
National Science Foundation0430450
Air Force Research Laboratory9550-04-1-0121
U.S. Air Force
Fonds De La Recherche Scientifique - FNRS
Ministero dell’Istruzione, dell’Università e della Ricerca

    Keywords

    • Oblivious transfer
    • Probabilistic input/output automata
    • Security protocols
    • Time-bounded task-PIOAs

    Fingerprint

    Dive into the research topics of 'Analyzing security protocols using time-bounded task-PIOAs'. Together they form a unique fingerprint.

    Cite this