Abstract
We propose a method for compiling a class of Σ-protocols (3-move public-coin protocols) into non-interactive zero-knowledge arguments. The method is based on homomorphic encryption and does not use random oracles. It only requires that a private/public key pair is set up for the verifier. The method applies to all known discrete-log based Σ-protocols. As applications, we obtain non-interactive threshold RSA without random oracles, and non-interactive zero-knowledge for NP more efficiently than by previous methods. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Damgård, I., Fazio, N., & Nicolosi, A. (2006). Non-interactive zero-knowledge from homomorphic encryption. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3876 LNCS, pp. 41–59). Springer Verlag. https://doi.org/10.1007/11681878_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
