Unifying simulatability definitions in cryptographic systems under different timing assumptions
From MaRDI portal
Publication:2484407
DOI10.1016/j.jlap.2004.09.002zbMath1078.68028OpenAlexW2016707036MaRDI QIDQ2484407
Publication date: 1 August 2005
Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlap.2004.09.002
Uses Software
Cites Work
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- A calculus for cryptographic protocols: The spi calculus
- Three systems for cryptographic protocol analysis
- Composition and behaviors of probabilistic I/O automata
- Player simulation and general adversary structures in perfect multiparty computation
- Security and composition of multiparty cryptographic protocols
- Logics for reasoning about cryptographic constructions
- Universally composable two-party and multi-party secure computation
- The Knowledge Complexity of Interactive Proof Systems
- On the security of public key protocols
- A logic of authentication
- A Probabilistic Polynomial-time Calculus For Analysis of Cryptographic Protocols
- Symmetric Authentication within a Simulatable Cryptographic Library
- Verifying secrets and relative secrecy
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Advances in Cryptology - CRYPTO 2003
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Unifying simulatability definitions in cryptographic systems under different timing assumptions
