Concurrent Zero-Knowledge
Publication year: 2006
: 978-3-540-32939-8
Zero-knowledge proofs are fascinating and extremely useful constructs. Their fascinating nature is due to their seemingly contradictory de?nition; ze- knowledge proofs are convincing and yet yield nothing beyond the validity of the assertion being proved. Their applicability in the domain of cryptography is vast; they are typically used to force malicious parties to behave according to a predetermined protocol. In addition to their direct applicability in cr- tography, zero-knowledge proofs serve as a good benchmark for the study of variousproblemsregardingcryptographicprotocols(e.g.,“securecomposition of protocols”).
: Computer Science, Black-box simulation, Concurrent zero-knowledge, Protocol security, Zero-knowledge, Zero-knowledge proof systems, algorithms, communication, cryptography
