Pages that link to "Item:Q5428134"
From MaRDI portal
The following pages link to Advances in Cryptology - CRYPTO 2003 (Q5428134):
Displayed 15 items.
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Efficient cache attacks on AES, and countermeasures (Q2267358) (← links)
- Cryptographic puzzles and DoS resilience, revisited (Q2510662) (← links)
- Efficiently Computing Data-Independent Memory-Hard Functions (Q2829217) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Balloon Hashing: A Memory-Hard Function Providing Provable Protection Against Sequential Attacks (Q2958121) (← links)
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713) (← links)
- Proof of Space from Stacked Expanders (Q3179360) (← links)
- Designing Proof of Human-Work Puzzles for Cryptocurrency and Beyond (Q3181039) (← links)
- An (Almost) Constant-Effort Solution-Verification Proof-of-Work Protocol Based on Merkle Trees (Q3506372) (← links)
- Resource Burning for Permissionless Systems (Invited Paper) (Q5100943) (← links)
- Depth-Robust Graphs and Their Cumulative Memory Complexity (Q5270356) (← links)
- Scrypt Is Maximally Memory-Hard (Q5270357) (← links)
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (Q6067351) (← links)
- Parallelizable delegation from LWE (Q6114288) (← links)