Computationally Sound Proofs
From MaRDI portal
Publication:4507393
DOI10.1137/S0097539795284959zbMath1009.68053MaRDI QIDQ4507393
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
Subquadratic SNARGs in the random oracle model, An algebraic framework for universal and updatable SNARKs, A Note on the Instantiability of the Quantum Random Oracle, Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration, Non-malleable codes for bounded parallel-time tampering, Succinct non-interactive arguments via linear interactive proofs, On the statistical leak of the GGH13 multilinear map and some variants, Does Fiat-Shamir require a cryptographic hash function?, On the (In)Security of SNARKs in the Presence of Oracles, Parallel Hashing via List Recoverability, Proofs of Space, Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation, Interactive Oracle Proofs, More efficient amortization of exact zero-knowledge proofs for LWE, Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs, The wonderful world of global random oracles, Fully leakage-resilient signatures, A PCP theorem for interactive proofs and applications, On succinct non-interactive arguments in relativized worlds, Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings, Succinct arguments in the quantum random oracle model, Fully homomorphic NIZK and NIWI proofs, Linear-size constant-query IOPs for delegating computation, On the (In)security of Kilian-based SNARGs, Refereed delegation of computation, Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge, Witness-succinct universally-composable SNARKs, Proof-carrying data from arithmetized random oracles, Proving knowledge of isogenies: a survey, Succinct vector, polynomial, and functional commitments from lattices, Non-interactive publicly-verifiable delegation of committed programs, Scalable zero knowledge via cycles of elliptic curves, NIZK from SNARGs, Non-black-box simulation in the fully concurrent setting, revisited, Parallelizable delegation from LWE, Faster sounder succinct arguments and \textsf{IOP}s, Succinct interactive oracle proofs: applications and limitations, \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions, Parallel repetition of computationally sound protocols revisited, Orion: zero knowledge proof with linear prover time, Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II, One-time programs from commodity hardware, The hunting of the SNARK, Public-coin parallel zero-knowledge for NP, Tight security bounds for Micali's SNARGs, PCPs and the hardness of generating synthetic data, Minting mechanism for proof of stake blockchains, Fast Reed-Solomon Interactive Oracle Proofs of Proximity, Optimal security proofs for full domain hash. Revisited, On the Connection between Leakage Tolerance and Adaptive Security, Limitation on the Rate of Families of Locally Testable Codes, Short Locally Testable Codes and Proofs: A Survey in Two Parts, No-signaling linear PCPs, Unnamed Item, No-signaling linear PCPs, Rational Sumchecks, Tighter security proofs for GPV-IBE in the quantum random oracle model, Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security, The Complexity of Zero Knowledge, Efficient verifiable delay functions, SPARKs: succinct parallelizable arguments of knowledge, \textsc{Fractal}: post-quantum and transparent recursive proofs from holography, Short Locally Testable Codes and Proofs, On the Existence of Extractable One-Way Functions, Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems, On succinct arguments and witness encryption from groups, Practical product proofs for lattice commitments, Unnamed Item, Interactive proofs for social graphs, Computing on authenticated data, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs, Lattice-Based SNARGs and Their Application to More Efficient Obfuscation, Computational Integrity with a Public Random String from Quasi-Linear PCPs
