scientific article; zbMATH DE number 1844585
From MaRDI portal
Publication:4786018
zbMath1001.68673MaRDI QIDQ4786018
Tuomas Aura, Pekka Nikander, Jussipekka Leiwo
Publication date: 12 December 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2133/21330170
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99) Network protocols (68M12)
Related Items
Improved Cryptographic Puzzle Based on Modular Exponentiation ⋮ Resource Burning for Permissionless Systems (Invited Paper) ⋮ Cryptographic puzzles and DoS resilience, revisited ⋮ Stronger Difficulty Notions for Client Puzzles and Denial-of-Service-Resistant Protocols ⋮ Towards Denial-of-Service-Resilient Key Agreement Protocols ⋮ Towards a security model for computational puzzle schemes ⋮ Towards a Provably Secure DoS-Resilient Key Exchange Protocol with Perfect Forward Secrecy