Pages that link to "Item:Q5270364"
From MaRDI portal
The following pages link to Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364):
Displaying 19 items.
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- How to build time-lock encryption (Q1791669) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Subquadratic SNARGs in the random oracle model (Q2120100) (← links)
- Sumcheck arguments and their applications (Q2120101) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation (Q2319626) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Rinocchio: SNARKs for ring arithmetic (Q6070447) (← links)
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions (Q6104342) (← 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)
- A simple and efficient framework of proof systems for NP (Q6562565) (← links)
