Non-interactive zero-knowledge from homomorphic encryption

Ivan Damgård, Nelly Fazio, Antonio Nicolosi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

42 Scopus citations

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.

Original languageEnglish
Title of host publicationTheory of Cryptography
Subtitle of host publicationThird Theory of Cryptography Conference, TCC 2006, Proceedings
Pages41-59
Number of pages19
DOIs
StatePublished - 2006
Event3rd Theory of Cryptography Conference, TCC 2006 - New York, NY, United States
Duration: 4 Mar 20067 Mar 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3876 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Theory of Cryptography Conference, TCC 2006
Country/TerritoryUnited States
CityNew York, NY
Period4/03/067/03/06

Fingerprint

Dive into the research topics of 'Non-interactive zero-knowledge from homomorphic encryption'. Together they form a unique fingerprint.

Cite this