Paper 2012/563

Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

Kai-Min Chung, Huijia Lin, and Rafael Pass

Abstract

We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly speaking, that Micali's non-interactive CS-proofs are sound for languages in P.

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Published elsewhere. Unknown where it was published
Keywords
Concurrent Zero KnowledgeP-certificatesFalsifiable AssumptionsNon-black-box Simulation
Contact author(s)
chung @ cs cornell edu
History
2012-10-07: received
Short URL
https://ia.cr/2012/563
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/563,
      author = {Kai-Min Chung and Huijia Lin and Rafael Pass},
      title = {Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions},
      howpublished = {Cryptology ePrint Archive, Paper 2012/563},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/563}},
      url = {https://eprint.iacr.org/2012/563}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.