Reasoning about probabilistic security using task-PIOAs

Authors:
Aaron D. Jaggard;Catherine Meadows;Michael Mislove;Roberto Segala
Affiliations:
Rutgers University, New Brunswick, NJ;Naval Research Lab, Washington, DC;Tulane University, New Orleans, LA;University of Verona, Italy
Venue:
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Year:
2010

Citing 18
Cited 0

The dining cryptographers problem: unconditional sender and recipient untraceability

Journal of Cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Bisimulation through probabilistic testing

Information and Computation
Domain theory

Handbook of logic in computer science (vol. 3)
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
A calculus for cryptographic protocols

Information and Computation
Probabilistic simulations for probabilistic processes

Nordic Journal of Computing
CSP and Anonymity

ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Nondeterminism and Probabilistic Choice: Obeying the Laws

CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Compositional Methods for Probabilistic Systems

CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Approximating labelled Markov processes

Information and Computation
Probabilistic anonymity

CONCUR 2005 - Concurrency Theory
A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols

Theoretical Computer Science
Labelled Markov Processes as Generalised Stochastic Relations

Electronic Notes in Theoretical Computer Science (ENTCS)
Anonymity protocols as noisy channels

Information and Computation
Probabilistic anonymity via coalgebraic simulations

ESOP'07 Proceedings of the 16th European conference on Programming
Making random choices invisible to the scheduler

CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Task-structured probabilistic input/output automata (Task-PIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framework for the universal composability paradigms of protocol security. One of their advantages is that that they allow one to distinguish high-level nondeterminism that can affect the outcome of the protocol, from low-level choices, which can't. We present an alternative approach to analyzing the structure of Task-PIOAs that relies on ordered sets. We focus on two of the components that are required to define and apply Task-PIOAs: discrete probability theory and automata theory. We believe our development gives insight into the structure of Task-PIOAs and how they can be utilized to model crypto-protocols. We illustrate our approach with an example from anonymity, an area that has not previously been addressed using Task-PIOAs. We model Chaum's Dining Cryptographers Protocol at a level that does not require cryptographic primitives in the analysis. We show via this example how our approach can leverage a proof of security in the case a principal behaves deterministically to prove security when that principal behaves probabilistically.