UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Making Sigma-Protocols Non-interactive Without Random Oracles

Chaidos, P; Groth, J; (2015) Making Sigma-Protocols Non-interactive Without Random Oracles. In: Katz, J, (ed.) Proceedings of Public-Key Cryptography -- PKC 2015. (pp. pp. 650-670). Springer: Gaithersburg, MD, USA. Green open access

[thumbnail of DFN-voting-2015-May.pdf]
Preview
Text
DFN-voting-2015-May.pdf
Available under License : See the attached licence file.

Download (444kB)

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 answer. The transformation does not rely on the random oracle model but proving soundness requires a complexity leveraging assumption. We propose an alternative instantiation of their transformation and show that it achieves culpable soundness without complexity leveraging. This improves upon an earlier result by Ventre and Visconti (Africacrypt 2009), who used a different construction which achieved weak culpable soundness. We demonstrate how our construction can be used to prove validity of encrypted votes in a referendum. This yields a voting system with homomorphic tallying that does not rely on the Fiat-Shamir heuristic.

Type: Proceedings paper
Title: Making Sigma-Protocols Non-interactive Without Random Oracles
Event: 18th IACR International Conference on Practice and Theory in Public-Key Cryptography
ISBN-13: 9783662464465
Open access status: An open access version is available from UCL Discovery
DOI: 10.1007/978-3-662-46447-2_29
Publisher version: http://dx.doi.org/10.1007/978-3-662-46447-2
Language: English
Additional information: This version is the author accepted manuscript. For information on re-use, please refer to the publisher’s terms and conditions.
Keywords: Sigma-protocols, non-interactive zero-knowledge designated, verifier argument, DFN transformation, culpable soundness, voting.
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/1468749
Downloads since deposit
120Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item