Pages that link to "Item:Q1653086"
From MaRDI portal
The following pages link to Quasi-optimal SNARGs via linear multi-prover interactive proofs (Q1653086):
Displaying 17 items.
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Tight security bounds for Micali's SNARGs (Q2695642) (← links)
- Explainable arguments (Q6045191) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- NIZK from SNARGs (Q6110372) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- Lower bound on SNARGs in the random oracle model (Q6163944) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Zero-history confidential chains with zero-knowledge contracts: a new normal for decentralized ledgers? (Q6173284) (← links)
