Making Sigma-protocols non-interactive without random oracles

DOI10.1007/978-3-662-46447-2_29MaRDI QIDQ2941214zbMATH OpenOpenAlexFDO

Authors Pyrros Chaidos, Jens Groth

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

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

Recommendations

• Theory of Cryptography
• Optimally sound sigma protocols under DCRA
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
• Non-interactive Zero-Knowledge Arguments for Voting

Cited in

(11)

• Confidential and efficient asset proof for bitcoin exchanges
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Theory of Cryptography
• How not to prove yourself: pitfalls of the fiat-shamir heuristic and applications to helios
• Improved OR-composition of sigma-protocols
• Rational modular encoding in the DCR setting: non-interactive range proofs and Paillier-based Naor-Yung in the standard model
• One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model
• Optimally sound sigma protocols under DCRA
• Compact designated verifier NIZKs from the CDH assumption without pairings
• Multi-theorem preprocessing NIZKs from lattices
• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge

This page was built for publication: Making Sigma-protocols non-interactive without random oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941214)