Sciweavers

Share
ASIACRYPT
2010
Springer

Optimistic Concurrent Zero Knowledge

8 years 11 months ago
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
Alon Rosen, Abhi Shelat
Added 10 Feb 2011
Updated 10 Feb 2011
Type Journal
Year 2010
Where ASIACRYPT
Authors Alon Rosen, Abhi Shelat
Comments (0)
books