Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
From MaRDI portal
Publication:6045075
DOI10.1007/978-3-030-92068-5_21zbMATH Open1514.94081OpenAlexW3203552942MaRDI QIDQ6045075FDOQ6045075
Authors: Prastudy Fauzi, Helger Lipmaa, Janno Siim, Michal Zajac 
Publication date: 26 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_21
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- Short signatures from the Weil pairing
- Trapdoors for hard lattices and new cryptographic constructions
- Resettable zero-knowledge (extended abstract)
- Title not available (Why is that?)
- The knowledge complexity of interactive proof-systems
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Definitions and properties of zero-knowledge proof systems
- How to delegate computations
- On Signatures of Knowledge
- Non-interactive Zaps and New Techniques for NIZK
- Title not available (Why is that?)
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On Robust Combiners for Oblivious Transfer and Other Primitives
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Short pairing-based non-interactive zero-knowledge arguments
- Computationally Sound Proofs
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Shorter quasi-adaptive NIZK proofs for linear subspaces
- Advances in Cryptology - CRYPTO 2003
- Robust Multi-property Combiners for Hash Functions Revisited
- How to delegate computations publicly
- Updatable and universal common reference strings with applications to zk-SNARKs
- A non-interactive shuffle argument with low trust assumptions
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
- NIZKs with an untrusted CRS: security in the face of parameter subversion
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the size of pairing-based non-interactive arguments
- Cliptography: clipping the power of kleptographic attacks
- Non-interactive zaps of knowledge
- Limits of extractability assumptions with distributional auxiliary input
- Square span programs with applications to succinct NIZK arguments
- The hunting of the SNARK
- Extractable Perfectly One-Way Functions
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- On QA-NIZK in the BPK model
- Statistical ZAPR arguments from bilinear maps
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- Exploring constructions of compact NIZKs from various assumptions
- ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
- On the existence of extractable one-way functions
This page was built for publication: Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6045075)
