Pages that link to "Item:Q3650711"
From MaRDI portal
The following pages link to Security Notions and Generic Constructions for Client Puzzles (Q3650711):
Displaying 6 items.
- Cryptographic puzzles and DoS resilience, revisited (Q2510662) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols (Q3073713) (← links)
- Towards a security model for computational puzzle schemes (Q3101621) (← links)
- Improved Cryptographic Puzzle Based on Modular Exponentiation (Q3449412) (← links)
- Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting) (Q6067351) (← links)