Composition with knowledge assumptions
From MaRDI portal
Publication:2139641
Recommendations
Cites work
- scientific article; zbMATH DE number 176566 (Why is no real title available?)
- scientific article; zbMATH DE number 1302862 (Why is no real title available?)
- scientific article; zbMATH DE number 2086702 (Why is no real title available?)
- scientific article; zbMATH DE number 1842484 (Why is no real title available?)
- Another look at extraction and randomization of Groth's zk-SNARK
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Coupling of random systems
- Extractable Perfectly One-Way Functions
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Limits of extractability assumptions with distributional auxiliary input
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Mining for privacy: how to bootstrap a snarky blockchain
- On the size of pairing-based non-interactive arguments
- Snarky signatures: minimal signatures of knowledge from simulation-extractable snarks
- The algebraic group model and its applications
- Towards a Theory of Extractable Functions
- Updatable and universal common reference strings with applications to zk-SNARKs
Cited in
(6)
This page was built for publication: Composition with knowledge assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139641)