Non-interactive zero-knowledge from non-interactive batch arguments
From MaRDI portal
Publication:6186697
DOI10.1007/978-3-031-38545-2_2OpenAlexW4385654407MaRDI QIDQ6186697FDOQ6186697
Authors: Jeffrey Champion, David J. Wu 
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38545-2_2
Recommendations
Cites Work
- Title not available (Why is that?)
- Minimum disclosure proofs of knowledge
- The knowledge complexity of interactive proof-systems
- Title not available (Why is that?)
- Candidate one-way functions based on expander graphs
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Title not available (Why is that?)
- On ε‐biased generators in NC0
- Enhancements of trapdoor permutations
- A dichotomy for local small-bias generators
- Lossy trapdoor functions and their applications
- Perfect Non-interactive Zero Knowledge for NP
- Advances in Cryptology - EUROCRYPT 2004
- 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
- On the Security of Goldreich’s One-Way Function
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Leftover Hash Lemma, Revisited
- New techniques for noninteractive zero-knowledge
- How to delegate computations publicly
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Scalable zero knowledge with no trusted setup
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Certifying trapdoor permutations, revisited
- Title not available (Why is that?)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- Cryptographic hardness of random local functions -- survey
- Lattice-based SNARGs and their application to more efficient obfuscation
- Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes
- On the size of pairing-based non-interactive arguments
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- On the existence of extractable one-way functions
- The hunting of the SNARK
- On the concrete security of Goldreich's pseudorandom generator
- Trapdoor hash functions and their applications
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- NIZK from SNARG
- Non-interactive zero knowledge from sub-exponential DDH
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- Reusable designated-verifier NIZKs for all NP from CDH
- Cryptographic group actions and applications
- Fiat-Shamir: from practice to theory
- Algebraic attacks against random local functions and their countermeasures
- Indistinguishability obfuscation from well-founded assumptions
- Non-interactive batch arguments for NP from standard assumptions
- SNARGs for P from sub-exponential DDH and QR
- Title not available (Why is that?)
- Somewhere statistical soundness, post-quantum security, and SNARGs
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- A map of witness maps: new definitions and connections
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
Cited In (1)
This page was built for publication: Non-interactive zero-knowledge from non-interactive batch arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186697)
