Adaptively sound zero-knowledge SNARKs for UP
From MaRDI portal
Recommendations
Cites work
- Adaptive security in SNARGs via iO and lossy functions
- Advances in Cryptology - EUROCRYPT 2004
- Boosting batch arguments and RAM delegation
- Candidate witness encryption from lattice techniques
- Computationally Sound Proofs
- Constrained pseudorandom functions and their applications
- Delegation for bounded space
- Fiat-Shamir: from practice to theory
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Generating shorter bases for hard random lattices
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Graph-induced multilinear maps from lattices
- How to avoid obfuscation using witness PRFs
- How to delegate computations
- How to delegate computations publicly
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 4059391 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Impossibilities in succinct arguments: black-box extraction and more
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Key homomorphic PRFs and their applications
- Multi-authority ABE from lattices without random oracles
- On lattices, learning with errors, random linear codes, and cryptography
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Public-key cryptosystems from the worst-case shortest vector problem
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Snarks for C: verifying program executions succinctly and in zero knowledge
- Succinct non-interactive arguments via linear interactive proofs
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Witness encryption and null-iO from evasive LWE
Cited in
(11)- On black-box knowledge-sound commit-and-prove SNARKs
- Holographic SNARGs for P and batch-NP from (polynomially hard) learning with errors
- Adaptive security in SNARGs via iO and lossy functions
- Incrementally verifiable computation for NP from standard assumptions
- A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP
- Simple and general counterexamples for private-coin evasive LWE
- Pseudorandom obfuscation and applications
- Succinct PPRFs via memory-tight reductions
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Indistinguishability obfuscation from well-founded assumptions
- Zeroizing attacks against evasive and circular evasive LWE
This page was built for publication: Adaptively sound zero-knowledge SNARKs for UP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660292)
