Computationally Sound Proofs
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On the statistical leak of the GGH13 multilinear map and some variants
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- The wonderful world of global random oracles
- Scalable zero knowledge via cycles of elliptic curves
- The hunting of the SNARK
- Optimal security proofs for full domain hash. Revisited
- Public-coin parallel zero-knowledge for NP
- SPARKs: succinct parallelizable arguments of knowledge
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- On succinct arguments and witness encryption from groups
- Practical product proofs for lattice commitments
- Interactive proofs for social graphs
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- Subquadratic SNARGs in the random oracle model
- An algebraic framework for universal and updatable SNARKs
- 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
- Does Fiat-Shamir require a cryptographic hash function?
- More efficient amortization of exact zero-knowledge proofs for LWE
- A PCP theorem for interactive proofs and applications
- On succinct non-interactive arguments in relativized worlds
- 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
- PCPs and the hardness of generating synthetic data
- Minting mechanism for proof of stake blockchains
- Computing on authenticated data
- Fully leakage-resilient signatures
- Non-black-box simulation in the fully concurrent setting, revisited
- Tight security bounds for Micali's SNARGs
- Rational sumchecks
- Non-black-box simulation from one-way functions and applications to resettable security
- On the existence of extractable one-way functions
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Short locally testable codes and proofs
- On the (in)security of SNARKs in the presence of oracles
- Interactive oracle proofs
- scientific article; zbMATH DE number 4205986 (Why is no real title available?)
- Parallel Hashing via List Recoverability
- Proofs of space
- Constant-round concurrent zero-knowledge from indistinguishability obfuscation
- Refereed delegation of computation
- Parallel repetition of computationally sound protocols revisited
- scientific article; zbMATH DE number 1136108 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Low-complexity cryptographic hash functions
- 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
- Fast Reed-Solomon interactive oracle proofs of proximity
- A Note on the Instantiability of the Quantum Random Oracle
- Probabilistic checking against non-signaling strategies from linearity testing
- Lattice-based SNARGs and their application to more efficient obfuscation
- Computational integrity with a public random string from quasi-linear PCPs
- The Complexity of Zero Knowledge
- No-signaling linear PCPs
- Efficient verifiable delay functions
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- No-signaling linear PCPs
- 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
- NIZK from SNARGs
- 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
- 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
- When Arthur has neither random coins nor time to spare: superfast derandomization of proof systems
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Fiat-Shamir security of FRI and related SNARKs
- A simple and efficient framework of proof systems for NP
- Locally verifiable distributed SNARGs
- Rogue-instance security for batch knowledge proofs
- On black-box verifiable outsourcing
- Generalized special-sound interactive proofs and their knowledge soundness
- Lattice-based functional commitments: fast verification and cryptanalysis
- Verifiable isogeny walks: towards an isogeny-based postquantum VDF
- Vector commitments with proofs of smallness: short range proofs and more
- Adaptively sound zero-knowledge SNARKs for UP
- Zero-knowledge IOPs approaching witness length
- BOIL: proof-carrying data from accumulation of correlated holographic IOPs
- Malicious security for PIR (almost) for free
- Succinct arguments for \textsf{BatchQMA} and friends under 8 rounds
- Towards a white-box secure Fiat-Shamir transformation
- How to prove false statements: practical attacks on Fiat-Shamir
- Black-box constant-round secure 2PC with succinct communication
- Blaze: fast SNARKs from interleaved RAA codes
- On the black-box complexity of correlation intractability
- NP-hardness of approximating meta-complexity: a cryptographic approach
- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- From one-time to two-round reusable multi-signatures without nested forking
- Security bounds for proof-carrying data from straightline extractors
This page was built for publication: Computationally Sound Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4507393)
