Adaptive security in SNARGs via iO and lossy functions

DOI10.1007/978-3-031-68403-6_3MaRDI QIDQ6660293FDOQ6660293

Authors: Brent Waters, Mark Zhandry 

Publication date: 10 January 2025

Recommendations

• Adaptively sound zero-knowledge SNARKs for UP
• Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG
• Lower bound on SNARGs in the random oracle model
• Lattice-based SNARGs and their application to more efficient obfuscation
• Lattice-based zero-knowledge SNARGs for arithmetic circuits

zbMATH Keywords

adaptive soundnesssuccinct non-interactive argument for NP

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Cryptography (94A60)

Cites Work

• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Lossy trapdoor functions and their applications
• How to use indistinguishability obfuscation
• Separating succinct non-interactive arguments from all falsifiable assumptions
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Secure two-party computation with low communication
• Short pairing-based non-interactive zero-knowledge arguments
• Succinct non-interactive arguments via linear interactive proofs
• Quadratic span programs and succinct NIZKs without PCPs
• Generating shorter bases for hard random lattices
• Theory of Cryptography
• Obfuscation of probabilistic circuits and applications
• Constrained pseudorandom functions and their applications
• Functional signatures and pseudorandom functions
• The Magic of ELFs
• Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
• Automata, Languages and Programming
• Structure vs. hardness through the obfuscation lens
• The hunting of the SNARK
• Trapdoor hash functions and their applications
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
• On constructing one-way permutations from indistinguishability obfuscation
• On ELFs, deterministic encryption, and correlated-input security
• Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
• Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
• Impossibilities in succinct arguments: black-box extraction and more
• Security-preserving distributed samplers: how to generate any CRS in one round without random oracles
• Lattice-based succinct arguments from vanishing polynomials (extended abstract)
• Compact selective opening security from LWE
• Adaptively sound zero-knowledge SNARKs for UP
• Adaptive security in SNARGs via iO and lossy functions

Cited In (2)

• Adaptively sound zero-knowledge SNARKs for UP
• Adaptive security in SNARGs via iO and lossy functions

This page was built for publication: Adaptive security in SNARGs via iO and lossy functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660293)