Non-interactive zero-knowledge from non-interactive batch arguments
From MaRDI portal
Publication:6186697
DOI10.1007/978-3-031-38545-2_2OpenAlexW4385654407MaRDI QIDQ6186697
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimum disclosure proofs of knowledge
- Certifying trapdoor permutations, revisited
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- The hunting of the SNARK
- On the concrete security of Goldreich's pseudorandom generator
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \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
- Non-interactive batch arguments for NP from standard assumptions
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- SNARGs for P from sub-exponential DDH and QR
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Reusable designated-verifier NIZKs for all NP from CDH
- Trapdoor hash functions and their applications
- Scalable zero knowledge with no trusted setup
- Enhancements of trapdoor permutations
- Cryptographic group actions and applications
- Somewhere statistical soundness, post-quantum security, and SNARGs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Secure Two-Party Computation with Low Communication
- A Dichotomy for Local Small-Bias Generators
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Candidate One-Way Functions Based on Expander Graphs
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Lossy trapdoor functions and their applications
- Perfect Non-interactive Zero Knowledge for NP
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- On the Security of Goldreich’s One-Way Function
- The knowledge complexity of interactive proof-systems
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Cryptographic Hardness of Random Local Functions–Survey
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Leftover Hash Lemma, Revisited
- Fiat-Shamir: from practice to theory
- How to delegate computations publicly
- On the existence of extractable one-way functions
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic attacks against random local functions and their countermeasures
- New Techniques for Noninteractive Zero-Knowledge
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On ε‐biased generators in NC0
- On the Size of Pairing-Based Non-interactive Arguments
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Indistinguishability obfuscation from well-founded assumptions
- A map of witness maps: new definitions and connections
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
This page was built for publication: Non-interactive zero-knowledge from non-interactive batch arguments
