Bibliographic Details
| Title: |
On the Amortized Complexity of Zero-Knowledge Protocols. |
| Authors: |
Cramer, Ronald cramer@cwi.nl, Damgård, Ivan1 ivan@cs.au.dk, Keller, Marcel2 m.keller@bristol.ac.uk |
| Source: |
Journal of Cryptology. Spring2014, Vol. 27 Issue 2, p284-316. 33p. |
| Subjects: |
Zero-knowledge proofs, Computer network protocols, Computational complexity, Probability theory, Logarithms, Error analysis in mathematics |
| 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 x and error probability 2 was O(| x| n) bits. By using our technique to prove n instances simultaneously, we can bring down the proof size per instance to O(| x|+ n) bits for the same error probability while using no computational assumptions. Examples where our technique applies include proofs for quadratic residuosity, proofs of subgroup membership and knowledge of discrete logarithms in groups of unknown order, interval proofs of the latter, and proofs of plaintext knowledge for various types of homomorphic encryption schemes. We first propose our protocols as Σ-protocols and extend them later to zero-knowledge proofs of knowledge. [ABSTRACT FROM AUTHOR] |
|
Copyright of Journal of Cryptology is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
