Optimistic Concurrent Zero Knowledge

We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is expected to require only a small constant number of rounds in practice. To prove that our protocol is secure, we identify a weak property of concurrent schedules--called footer-freeness--that suffices for efficient simulation. Keywords. concurrent zero-knowledge, rational, optimistic

• Type: Journal
• Year: 2010
• Where: ASIACRYPT
• Authors: Alon Rosen, Abhi Shelat
• Keywords: ASIACRYPT 2010, Concurrent Zeroknowledge Protocol, Cryptographic Protocols, Cryptology, Small Constant Number