Making Sigma-Protocols Non-interactive Without Random Oracles

Abstract

Damg̊ard, Fazio and Nicolosi (TCC 2006) gave a transformation of Sigma-protocols, 3-move honest verifier zero-knowledge proofs, into efficient non-interactive zero-knowledge arguments for a designated verifier. Their transformation uses additively homomorphic encryption to encrypt the verifier’s challenge, which the prover uses to compute an encrypted… (More)
DOI: 10.1007/978-3-662-46447-2_29

Topics

6 Figures and Tables

Slides referencing similar topics