Analyzing Security Protocols Using Time-Bounded Task-PIOAs

Authors:
Ran Canetti;Ling Cheung;Dilsun Kaynar;Moses Liskov;Nancy Lynch;Olivier Pereira;Roberto Segala
Affiliations:
IBM T.J. Watson Center, Hawthorne, USA and Massachusetts Institute of Technology, Cambridge, USA;Massachusetts Institute of Technology, Cambridge, USA;Carnegie Mellon University, Pittsburgh, USA;The College of William and Mary, Williamsburg, USA;Massachusetts Institute of Technology, Cambridge, USA;Université catholique de Louvain, Louvain-la-Neuve, Belgium;Università di Verona, Verona, Italy
Venue:
Discrete Event Dynamic Systems
Year:
2008

Citing 21
Cited 11

A randomized protocol for signing contracts

Communications of the ACM
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Modeling and verification of randomized distributed real-time systems

Modeling and verification of randomized distributed real-time systems
A probabilistic poly-time framework for protocol analysis

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Composition and integrity preservation of secure reactive systems

Proceedings of the 7th ACM conference on Computer and communications security
Universally composable two-party and multi-party secure computation

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
Unconditional Security Against Memory-Bounded Adversaries

CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission

SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
A composable cryptographic library with nested operations

Proceedings of the 10th ACM conference on Computer and communications security
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study

Distributed Computing
A Computationally Sound Mechanized Prover for Security Protocols

SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
Simulation-Based Security with Inexhaustible Interactive Turing Machines

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
Foundations of Cryptography: Volume 1

Foundations of Cryptography: Volume 1
Compositional Security for Task-PIOAs

CSF '07 Proceedings of the 20th IEEE Computer Security Foundations Symposium
Observing Branching Structure through Probabilistic Contexts

SIAM Journal on Computing
Long-term security and universal composability

TCC'07 Proceedings of the 4th conference on Theory of cryptography
Universally composable symbolic analysis of mutual authentication and key-exchange protocols

TCC'06 Proceedings of the Third conference on Theory of Cryptography

The power of simulation relations

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Modeling Computational Security in Long-Lived Systems

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
A Universally Composable Framework for the Analysis of Browser-Based Security Protocols

ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Calibrating the power of schedulers for probabilistic polynomial-time calculus

Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Computational indistinguishability logic

Proceedings of the 17th ACM conference on Computer and communications security
Probabilistic Logical Characterization

Information and Computation
Abstract probabilistic automata

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Indifferentiable security reconsidered: role of scheduling

ISC'10 Proceedings of the 13th international conference on Information security
Formal Verification of Differential Privacy for Interactive Systems (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Layout Randomization and Nondeterminism

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract Probabilistic Automata

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

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.