Chapter

Advances in Cryptology - ASIACRYPT 2010

Volume 6477 of the series Lecture Notes in Computer Science pp 359-376

Optimistic Concurrent Zero Knowledge

  • Alon RosenAffiliated withIDC Herzileya
  • , Abhi ShelatAffiliated withU. of Virginia

Abstract

We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zero-knowledge 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