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_5zbMATH Open1354.94038OpenAlexW62648631MaRDI QIDQ5261625FDOQ5261625
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
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 (24)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Confidential and efficient asset proof for bitcoin exchanges
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials
- Fiat–Shamir for Highly Sound Protocols Is Instantiable
- Efficient NIZK arguments with straight-line simulation and extraction
- Fiat-Shamir for highly sound protocols is instantiable
- Efficient and round-optimal oblivious transfer and commitment with adaptive security
- Optimally Sound Sigma Protocols Under DCRA
- CRS-updatable asymmetric quasi-adaptive NIZK arguments
- Augmented random oracles
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles
- Improved OR-Composition of Sigma-Protocols
- Signatures from sequential-OR proofs
- A generic transform from multi-round interactive proof to NIZK
- Non-interactive composition of sigma-protocols via Share-then-Hash
- On adaptive security of delayed-input sigma protocols and Fiat-Shamir NIZKs
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions
- \(k\)-critical graphs in \(P_5\)-free graphs
- CDS composition of multi-round protocols
- Universally composable \(\varSigma \)-protocols in the global random-oracle model
- Interactive Oracle Proofs
- Acyclicity programming for sigma-protocols
- An Efficient Compiler from Σ-Protocol to 2-Move Deniable Zero-Knowledge
- Simulatable verifiable random function from the LWE assumption
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)
