Universal Arguments and their Applications
From MaRDI portal
Recommendations
Cited in
(60)- Handling expected polynomial-time strategies in simulation-based security proofs
- The hunting of the SNARK
- The ubiquitous axiom
- SPARKs: succinct parallelizable arguments of knowledge
- Constant-round leakage-resilient zero-knowledge from collision resistance
- Succinct non-interactive arguments via linear interactive proofs
- Non-malleable commitments against quantum attacks
- On the (In)security of Kilian-based SNARGs
- PCPs and the hardness of generating synthetic data
- On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits
- Non-uniformly sound certificates with applications to concurrent zero-knowledge
- Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries
- Fully leakage-resilient signatures
- Non-black-box simulation in the fully concurrent setting, revisited
- Concurrent knowledge extraction in public-key models
- Four-round zero-knowledge arguments of knowledge with strict polynomial-time simulation from differing-input obfuscation for circuits
- Constrained PRFs for unbounded inputs with short keys
- On the existence of extractable one-way functions
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- On zero-knowledge with strict polynomial-time simulation and extraction from differing-input obfuscation for circuits
- 3-message zero knowledge against human ignorance
- On the (in)security of SNARKs in the presence of oracles
- Interactive oracle proofs
- On non-black-box simulation and the impossibility of approximate obfuscation
- Three-round public-coin bounded-auxiliary-input zero-knowledge arguments of knowledge
- Proofs of space
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Succinct NP Proofs from an Extractability Assumption
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Refereed delegation of computation
- Parallel repetition of computationally sound protocols revisited
- Combinatorial PCPs with efficient verifiers
- On the connection between leakage tolerance and adaptive security
- Distinguishing distributions using Chernoff information
- Limitation on the Rate of Families of Locally Testable Codes
- Universal inference
- The Complexity of Zero Knowledge
- Predictable arguments of knowledge
- Theory of Cryptography
- No-signaling linear PCPs
- No-signaling linear PCPs
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- Parallelizable delegation from LWE
- Non-interactive universal arguments
- Succinct arguments for RAM programs via projection codes
- A new approach to efficient non-malleable zero-knowledge
- Universal reductions: reductions relative to stateful oracles
- Are PCPs inherent in efficient arguments?
- Rigid matrices from rectangular PCPs
- Constant-round arguments from one-way functions
- The NISQ complexity of collision finding
- Approximate lower bound arguments
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Reusable online-efficient commitments
- Fully malicious authenticated PIR
- Gap MCSP is not (Levin) NP-complete in obfustopia
- Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
- Untangling the security of Kilian's protocol: upper and lower bounds
- Quantum rewinding for IOP-based succinct arguments
This page was built for publication: Universal Arguments and their Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3642859)
