Paper 2015/446
On the Amortized Complexity of Zero-knowledge Protocols
Ronald Cramer, Ivan Damgård, and Marcel Keller
Abstract
We propose a general technique that allows improving the complexity of
zero-knowledge protocols for a large class of problems where
previously the best known solution was a simple cut-and-choose style
protocol, i.e., where the size of a proof for problem instance
Metadata
- Available format(s)
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in JOC 2014
- Keywords
- Sigma-protocolszero-knowledgeproof of knowledgehomomorphic encryptionrandom self-reducible problems
- Contact author(s)
- m keller @ bristol ac uk
- History
- 2015-05-09: received
- Short URL
- https://ia.cr/2015/446
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/446, author = {Ronald Cramer and Ivan Damgård and Marcel Keller}, title = {On the Amortized Complexity of Zero-knowledge Protocols}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/446}, year = {2015}, url = {https://eprint.iacr.org/2015/446} }