A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Making Sigma-Protocols Non-interactive Without Random Oracles
[chapter]
2015
Lecture Notes in Computer Science
Damgård, 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 answer. The transformation does not rely on the random oracle model but proving soundness requires a complexity leveraging assumption. We propose
doi:10.1007/978-3-662-46447-2_29
fatcat:m2hizuryardtzk7fq7rcet4dn4