Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 206-225
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Computationally sound verification of source code2010
- Computational soundness of symbolic zero-knowledge proofs*Journal of Computer Security, 2010
- Anonymous Webs of TrustLecture Notes in Computer Science, 2010
- CoSP2009
- Type-checking zero-knowledge2008
- Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol2008
- Symmetric authentication in a simulatable Dolev–Yao-style cryptographic libraryInternational Journal of Information Security, 2005
- OFMC: A symbolic model checker for security protocolsInternational Journal of Information Security, 2005
- Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption)*Journal of Cryptology, 2002
- A calculus for cryptographic protocols1997