An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
From MaRDI portal
Publication:5261625
DOI10.1007/978-3-662-46494-6_5zbMath1354.94038OpenAlexW62648631MaRDI QIDQ5261625
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
Related Items (19)
Confidential and efficient asset proof for bitcoin exchanges ⋮ Fiat-Shamir for highly sound protocols is instantiable ⋮ Interactive Oracle Proofs ⋮ A generic transform from multi-round interactive proof to NIZK ⋮ Augmented random oracles ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ 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 ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Signatures from sequential-OR proofs ⋮ Non-interactive zero-knowledge in pairing-free groups from weaker assumptions ⋮ Fiat–Shamir for Highly Sound Protocols Is Instantiable ⋮ Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials ⋮ Optimally Sound Sigma Protocols Under DCRA
This page was built for publication: An Efficient Transform from Sigma Protocols to NIZK with a CRS and Non-programmable Random Oracle
