The following pages link to Computationally Sound Proofs (Q4507393):
Displaying 50 items.
- Refereed delegation of computation (Q385709) (← links)
- Parallel repetition of computationally sound protocols revisited (Q421032) (← links)
- On the statistical leak of the GGH13 multilinear map and some variants (Q1633467) (← links)
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- Public-coin parallel zero-knowledge for NP (Q1946592) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Practical product proofs for lattice commitments (Q2096537) (← links)
- Interactive proofs for social graphs (Q2102081) (← links)
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs (Q2104234) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- An algebraic framework for universal and updatable SNARKs (Q2120103) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- More efficient amortization of exact zero-knowledge proofs for LWE (Q2148770) (← links)
- A PCP theorem for interactive proofs and applications (Q2170038) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- Minting mechanism for proof of stake blockchains (Q2229280) (← links)
- Computing on authenticated data (Q2344052) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- Non-black-box simulation in the fully concurrent setting, revisited (Q2423842) (← links)
- Tight security bounds for Micali's SNARGs (Q2695642) (← links)
- Rational Sumchecks (Q2799100) (← links)
- Non-Black-Box Simulation from One-Way Functions and Applications to Resettable Security (Q2802147) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- Short Locally Testable Codes and Proofs (Q3088191) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Parallel Hashing via List Recoverability (Q3457065) (← links)
- Proofs of Space (Q3457086) (← links)
- Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation (Q3457115) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- (Q4638056) (← links)
- On the Connection between Leakage Tolerance and Adaptive Security (Q4916027) (← links)
- Limitation on the Rate of Families of Locally Testable Codes (Q4933361) (← links)
- Short Locally Testable Codes and Proofs: A Survey in Two Parts (Q4933364) (← links)
- Fast Reed-Solomon Interactive Oracle Proofs of Proximity (Q5002680) (← links)
