Pages that link to "Item:Q3507432"
From MaRDI portal
The following pages link to Succinct NP Proofs from an Extractability Assumption (Q3507432):
Displaying 11 items.
- Refereed delegation of computation (Q385709) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- On subversion-resistant SNARKs (Q2039405) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Cryptographic Assumptions: A Position Paper (Q2796139) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
