Paper 2012/563 Original: eprint.iacr.org/2012/563 ↗
Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions
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
- Preprint.
- History
- 2012-10-07: last updated
- 2012-10-07: published
- Short URL
- https://ia.cr/2012/563
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2012/563}
}