Non-interactive zero-knowledge from non-interactive batch arguments
From MaRDI portal
Publication:6186697
Recommendations
Cites work
- scientific article; zbMATH DE number 708823 (Why is no real title available?)
- scientific article; zbMATH DE number 1136108 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 2009960 (Why is no real title available?)
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- A dichotomy for local small-bias generators
- A map of witness maps: new definitions and connections
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic attacks against random local functions and their countermeasures
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Candidate one-way functions based on expander graphs
- Certifying trapdoor permutations, revisited
- Cryptographic group actions and applications
- Cryptographic hardness of random local functions -- survey
- Enhancements of trapdoor permutations
- Fiat-Shamir: from practice to theory
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- How to delegate computations publicly
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Indistinguishability obfuscation from LPN over \(\mathbb{F}_p\), DLIN, and PRGs in \(NC^0\)
- Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs
- Indistinguishability obfuscation from trilinear maps and block-wise local PRGs
- 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)
- Leftover Hash Lemma, Revisited
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Lossy trapdoor functions and their applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Minimum disclosure proofs of knowledge
- NIZK from LPN and trapdoor hash via correlation intractability for approximable relations
- NIZK from SNARG
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more
- New techniques for noninteractive zero-knowledge
- Non-interactive batch arguments for NP from standard assumptions
- Non-interactive zero knowledge from sub-exponential DDH
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On the Security of Goldreich’s One-Way Function
- On the concrete security of Goldreich's pseudorandom generator
- On the existence of extractable one-way functions
- On the size of pairing-based non-interactive arguments
- On ε‐biased generators in NC0
- Perfect Non-interactive Zero Knowledge for NP
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Reusable designated-verifier NIZKs for all NP from CDH
- SNARGs for P from sub-exponential DDH and QR
- Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error
- Scalable zero knowledge with no trusted setup
- Secure two-party computation with low communication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Short pairing-based non-interactive zero-knowledge arguments
- Somewhere statistical soundness, post-quantum security, and SNARGs
- 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
- The knowledge complexity of interactive proof-systems
- Trapdoor hash functions and their applications
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
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)
