Pages that link to "Item:Q5270376"
From MaRDI portal
The following pages link to Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376):
Displaying 10 items.
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- A non-PCP approach to succinct quantum-safe zero-knowledge (Q2096535) (← links)
- New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust (Q2104237) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Linear-size constant-query IOPs for delegating computation (Q2175951) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Fast transforms over finite fields of characteristic two (Q2229746) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
