Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
From MaRDI portal
Publication:6169370
Recommendations
- Non-interactive batch arguments for NP from standard assumptions
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Succinct non-interactive arguments via linear interactive proofs
- Separating succinct non-interactive arguments from all falsifiable assumptions
Cites work
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Advances in Cryptology - CRYPTO 2003
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Constrained pseudorandom functions and their applications
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Functional signatures and pseudorandom functions
- How to use indistinguishability obfuscation
- scientific article; zbMATH DE number 1136108 (Why is no real title available?)
- scientific article; zbMATH DE number 1842483 (Why is no real title available?)
- Indistinguishability obfuscation for Turing machines with unbounded memory
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from well-founded assumptions
- Lattice-based SNARGs and their application to more efficient obfuscation
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Limits on the power of indistinguishability obfuscation and functional encryption
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- New realizations of somewhere statistically binding hashing and positional accumulators
- Non-interactive batch arguments for NP from standard assumptions
- On the communication complexity of secure function evaluation with long output
- On the existence of extractable one-way functions
- On the size of pairing-based non-interactive arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Recursive composition and bootstrapping for SNARKs and proof-carrying data
- Secure two-party computation with low communication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Succinct non-interactive arguments via linear interactive proofs
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- The hunting of the SNARK
Cited in
(13)- Non-interactive batch arguments for NP from standard assumptions
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- SNARGs for monotone policy batch NP
- Non-interactive zero-knowledge from non-interactive batch arguments
- Non-interactive zero-knowledge from LPN and MQ
- Constant-round arguments for batch-verification and bounded-space computations from one-way functions
- Incrementally verifiable computation for NP from standard assumptions
- On quantum money and evasive obfuscation
- Scalable distributed agreement from LWE: Byzantine agreement, broadcast, and leader election
- Batching adaptively-sound SNARGs for NP
- Succinct computational secret sharing for monotone circuits
- Succinct witness encryption for batch languages and applications
- Simple attacks against (extended) Fiat-Shamir
This page was built for publication: Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169370)
