TY - GEN
T1 - Non-interactive zero-knowledge from homomorphic encryption
AU - Damgård, Ivan
AU - Fazio, Nelly
AU - Nicolosi, Antonio
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33745559842&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33745559842&partnerID=8YFLogxK
U2 - 10.1007/11681878_3
DO - 10.1007/11681878_3
M3 - Conference contribution
AN - SCOPUS:33745559842
SN - 3540327312
SN - 9783540327318
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 41
EP - 59
BT - Theory of Cryptography
T2 - 3rd Theory of Cryptography Conference, TCC 2006
Y2 - 4 March 2006 through 7 March 2006
ER -