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. © 2010 International Association for Cryptologic Research.
Author supplied keywords
Cite
CITATION STYLE
Rosen, A., & Shelat, A. (2010). Optimistic concurrent zero knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6477 LNCS, pp. 359–376). Springer Verlag. https://doi.org/10.1007/978-3-642-17373-8_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
