Paper 2014/991

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation

Kai-Min Chung, Huijia Lin, and Rafael Pass

Abstract

We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol relies on the existence of families of collision-resistant hash functions, one-way permutations, and indistinguishability obfuscators for P/poly (with slightly super-polynomial security).

Metadata
Available format(s)
PDF
Publication info
Preprint. MINOR revision.
Keywords
Concurrent ZKConstant-RoundIndistinguishability Obfuscation
Contact author(s)
rachel lin @ cs ucsb edu
History
2014-12-18: revised
2014-12-18: received
See all versions
Short URL
https://ia.cr/2014/991
License
Creative Commons Attribution
CC BY

BibTeX

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