Universal Arguments and their Applications
From MaRDI portal
Publication:3642859
DOI10.1137/070709244zbMath1180.94047OpenAlexW2002919335MaRDI QIDQ3642859
Publication date: 6 November 2009
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/57afe1ed12fbeed2009ae02cd28962eb81f37d2a
error-correcting codesproofs of knowledgezero-knowledge proof systemsprobabilistic proof systemstree hashingcollision-resistant hashingcomputationally sound proof systemsprobabilistic checkable proofswitness indistinguishable proof systems
Related Items (43)
Concurrent knowledge extraction in public-key models ⋮ Constant-round leakage-resilient zero-knowledge from collision resistance ⋮ Succinct non-interactive arguments via linear interactive proofs ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge ⋮ Short PCPPs verifiable in polylogarithmic time with \(O(1)\) queries ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Proofs of Space ⋮ Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation ⋮ Interactive Oracle Proofs ⋮ Fully leakage-resilient signatures ⋮ Non-malleable commitments against quantum attacks ⋮ On the (In)security of Kilian-based SNARGs ⋮ Refereed delegation of computation ⋮ On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits ⋮ 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 ⋮ Non-black-box simulation in the fully concurrent setting, revisited ⋮ Parallelizable delegation from LWE ⋮ Succinct NP Proofs from an Extractability Assumption ⋮ Non-interactive universal arguments ⋮ Succinct arguments for RAM programs via projection codes ⋮ Parallel repetition of computationally sound protocols revisited ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Universal reductions: reductions relative to stateful oracles ⋮ The hunting of the SNARK ⋮ PCPs and the hardness of generating synthetic data ⋮ Combinatorial PCPs with efficient verifiers ⋮ On the Connection between Leakage Tolerance and Adaptive Security ⋮ On expected probabilistic polynomial-time adversaries: a suggestion for restricted definitions and their benefits ⋮ Distinguishing Distributions Using Chernoff Information ⋮ Limitation on the Rate of Families of Locally Testable Codes ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ The Complexity of Zero Knowledge ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for Circuits ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Handling expected polynomial-time strategies in simulation-based security proofs ⋮ 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
This page was built for publication: Universal Arguments and their Applications
