A randomized protocol for signing contracts
Communications of the ACM
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
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
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
ACM SIGACT news distributed computing column 24
ACM SIGACT News
The reactive simulatability (RSIM) framework for asynchronous systems
Information and Computation
A Probabilistic Scheduler for the Analysis of Cryptographic Protocols
Electronic Notes in Theoretical Computer Science (ENTCS)
Preservation of epistemic properties in security protocol implementations
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Relationship of Three Cryptographic Channels in the UC Framework
ProvSec '08 Proceedings of the 2nd International Conference on Provable Security
Bisimulation for Demonic Schedulers
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The layered games framework for specifications and analysis of security protocols
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Calibrating the power of schedulers for probabilistic polynomial-time calculus
Journal of Computer Security - Security Issues in Concurrency (SecCo'07)
Making random choices invisible to the scheduler
Information and Computation
Conditional automata: a tool for safe removal of negligible events
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems
Journal of Automated Reasoning
Making random choices invisible to the scheduler
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
A cryptographic model for branching time security properties: the case of contract signing protocols
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
| Hi-index | 0.00 |
We present the Time-Bounded Task-PIOA modeling framework, an extension of the Probabilistic I/O Automata (PIOA) framework that is intended to support modeling and verification of security protocols. Time-Bounded Task-PIOAs directly model probabilistic and nondeterministic behavior, partial-information adversarial scheduling, and time-bounded computation. Together, these features are adequate to support modeling of key aspects of security protocols, including secrecy requirements and limitations on the knowledge and computational power of adversarial parties. They also support security protocol verification, using methods that are compatible with informal 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.