Universally composable SNARKs with transparent setup without programmable random oracle
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Adaptive hardness and composable security in the plain model from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Concurrently composable security with shielded super-polynomial simulators
- Constant-Size Commitments to Polynomials and Their Applications
- Definitions and properties of zero-knowledge proof systems
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient NIZK arguments with straight-line simulation and extraction
- Efficient public-key cryptography in the presence of key leakage
- From polynomial IOP and commitments to non-malleable zkSNARKs
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2009954 (Why is no real title available?)
- scientific article; zbMATH DE number 1842511 (Why is no real title available?)
- Indistinguishable proofs of work or knowledge
- Interactive oracle proofs
- New notions of security: achieving universal composability without trusted setup
- On the (Ir)replaceability of global setups, or how (not) to use a global ledger
- On the size of pairing-based non-interactive arguments
- SNARKs for virtual machines are non-malleable
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- Spartan and bulletproofs are simulation-extractable (for free!)
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- The knowledge complexity of interactive proof-systems
- The wonderful world of global random oracles
- Transparent SNARKs from DARK compilers
- Universal composition with global subroutines: capturing global setup within plain UC
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- Witness-succinct universally-composable SNARKs
- Zero knowledge in the random oracle model, revisited
- zkSNARKs in the ROM with unconditional UC-security
This page was built for publication: Universally composable SNARKs with transparent setup without programmable random oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6862536)
