Theory of Cryptography Conference

TCC 2006: Theory of Cryptography pp 41-59

Non-interactive Zero-Knowledge from Homomorphic Encryption

  • Ivan Damgård
  • Nelly Fazio
  • Antonio Nicolosi
Conference paper

DOI: 10.1007/11681878_3

Volume 3876 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Damgård I., Fazio N., Nicolosi A. (2006) Non-interactive Zero-Knowledge from Homomorphic Encryption. In: Halevi S., Rabin T. (eds) Theory of Cryptography. TCC 2006. Lecture Notes in Computer Science, vol 3876. Springer, Berlin, Heidelberg

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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ivan Damgård
    • 1
  • Nelly Fazio
    • 2
  • Antonio Nicolosi
    • 2
  1. 1.Aarhus UniversityDenmark
  2. 2.Courant Institute of Mathematical SciencesNew York UniversityNYUSA