An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle

DOI10.1007/978-3-662-46494-6_5MaRDI QIDQ5261625zbMATH OpenOpenAlexFDO

Authors Yehuda Lindell

Publication date 6 July 2015

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46494-6_5

zbMATH Keywords

common reference string modelFiat-Shamir type transformnon-interactive zero-knowledge proof

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Non-interactive zero knowledge \textit{proofs} in the random oracle model
• On the Non-malleability of the Fiat-Shamir Transform
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• Fiat-Shamir: from practice to theory

Cited in

(30)

• Confidential and efficient asset proof for bitcoin exchanges
• Fiat-Shamir for highly sound protocols is instantiable
• Signatures from sequential-OR proofs
• Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
• On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
• Non-interactive zero knowledge \textit{proofs} in the random oracle model
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• Non-interactive composition of sigma-protocols via Share-then-Hash
• Acyclicity programming for sigma-protocols
• Simulatable verifiable random function from the LWE assumption
• A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
• Improved OR-composition of sigma-protocols
• Fiat-Shamir for highly sound protocols is instantiable
• Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials
• Making Sigma-protocols non-interactive without random oracles
• Interactive oracle proofs
• An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge
• Optimally sound sigma protocols under DCRA
• \(k\)-critical graphs in \(P_5\)-free graphs
• A generic transform from multi-round interactive proof to NIZK
• Augmented random oracles
• Efficient NIZK arguments with straight-line simulation and extraction
• Universally composable -protocols in the global random-oracle model
• CRS-updatable asymmetric quasi-adaptive NIZK arguments
• CDS composition of multi-round protocols
• Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
• Robust non-interactive zero-knowledge combiners

This page was built for publication: An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle

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