Paper 2016/681
Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
Ronald Cramer, Ivan Damgard, Chaoping Xing, and Chen Yuan
Abstract
We propose a new zero-knowledge protocol for proving knowledge of short preimages under additively homomorphic functions that map integer vectors to an Abelian group. The protocol achieves amortized efficiency in that it only needs to send
Note: This revision contains a stronger result than the original version, in that the protocol now works with a quadratic number of inputs instances rather than cubic as before.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in EUROCRYPT 2017
- Keywords
- zero-knowledgeprotocolsproofs of knowledge
- Contact author(s)
- ivan @ cs au dk
- History
- 2017-02-14: last of 2 revisions
- 2016-07-12: received
- See all versions
- Short URL
- https://ia.cr/2016/681
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/681, author = {Ronald Cramer and Ivan Damgard and Chaoping Xing and Chen Yuan}, title = {Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/681}, year = {2016}, url = {https://eprint.iacr.org/2016/681} }