Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
From MaRDI portal
Publication:5270364
DOI10.1007/978-3-319-56617-7_9zbMath1415.94412OpenAlexW2603155476MaRDI QIDQ5270364
David J. Wu, Yuval Ishai, Dan Boneh, Amit Sahai
Publication date: 23 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_9
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (21)
Subquadratic SNARGs in the random oracle model ⋮ Sumcheck arguments and their applications ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Secure multiparty computation with sublinear preprocessing ⋮ Succinct arguments in the quantum random oracle model ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ NIZK from SNARGs ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? ⋮ Lower bound on SNARGs in the random oracle model ⋮ Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation ⋮ Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ No-signaling linear PCPs ⋮ How to build time-lock encryption ⋮ No-signaling linear PCPs ⋮ Marlin: preprocessing zkSNARKs with universal and updatable SRS ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ On succinct arguments and witness encryption from groups
Uses Software
Cites Work
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Indistinguishability Obfuscation: From Approximate to Exact
- Perfect Structure on the Edge of Chaos
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- (Leveled) fully homomorphic encryption without bootstrapping
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Targeted malleability
- Practical Bootstrapping in Quasilinear Time
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Practical Multilinear Maps over the Integers
- Faster Bootstrapping with Polynomial Error
- Multiparty Key Exchange, Efficient Traitor Tracing, and More from Indistinguishability Obfuscation
- Secure Two-Party Computation with Low Communication
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Fully Homomorphic Encryption with Polylog Overhead
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Bootstrapping Obfuscators via Fast Pseudorandom Functions
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- FHEW: Bootstrapping Homomorphic Encryption in Less Than a Second
- How to Obfuscate Programs Directly
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- BKZ 2.0: Better Lattice Security Estimates
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Founding Cryptography on Tamper-Proof Hardware Tokens
- An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices
- Indistinguishability Obfuscation from Compact Functional Encryption
- Succinct NP Proofs from an Extractability Assumption
- On Ideal Lattices and Learning with Errors over Rings
- A Framework for Efficient and Composable Oblivious Transfer
- Polylogarithmic two-round argument systems
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The knowledge complexity of interactive proof-systems
- On the Power of Quantum Computation
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Candidate Multilinear Maps from Ideal Lattices
- Quadratic Span Programs and Succinct NIZKs without PCPs
- How to use indistinguishability obfuscation
- On the existence of extractable one-way functions
- Graph-Induced Multilinear Maps from Lattices
- Obfuscating Circuits via Composite-Order Graded Encoding
- Advances in Cryptology – CRYPTO 2004
- Protecting Obfuscation against Algebraic Attacks
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Classical hardness of learning with errors
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- Two-Round Secure MPC from Indistinguishability Obfuscation
- Noise-tolerant learning, the parity problem, and the statistical query model
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
