Making Sigma-Protocols Non-interactive Without Random Oracles

DOI10.1007/978-3-662-46447-2_29zbMath1345.94051OpenAlexW296058135MaRDI QIDQ2941214

Jens Groth, Pyrros Chaidos

Publication date: 27 August 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/1468749/

zbMATH Keywords

votingculpable soundnessDFN transformationnon-interactive zero-knowledge designated verifier argumentSigma-protocols

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (9)

Confidential and efficient asset proof for bitcoin exchanges ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Rational Modular Encoding in the DCR Setting: Non-interactive Range Proofs and Paillier-Based Naor-Yung in the Standard Model ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Compact designated verifier NIZKs from the CDH assumption without pairings ⋮ Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge ⋮ Optimally Sound Sigma Protocols Under DCRA

This page was built for publication: Making Sigma-Protocols Non-interactive Without Random Oracles