DOS-resistant authentication with client puzzles (transcript of discussion)

DOI10.1007/3-540-44810-1_23MaRDI QIDQ4786019zbMATH OpenFDO

Authors Tuomas Aura

Publication date 12 December 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2133/21330178

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Computing methodologies and applications (68U99)

Recommendations

• DOS-resistant authentication with client puzzles
• The moderately hard DoS-resistant authentication protocol on client puzzles
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• Towards Denial-of-Service-Resilient Key Agreement Protocols
• Security Notions and Generic Constructions for Client Puzzles

Cited in

(8)

• Cryptographic salt: A countermeasure against denial-of-service attacks
• Towards Denial-of-Service-Resilient Key Agreement Protocols
• Security Notions and Generic Constructions for Client Puzzles
• Denial of service, address ownership, and early authentication in the IPv6 world (Transcript of discussion)
• The moderately hard DoS-resistant authentication protocol on client puzzles
• Broadening the scope of fault tolerance within secure services (transcript of discussion)
• DOS-resistant authentication with client puzzles
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)

This page was built for publication: DOS-resistant authentication with client puzzles (transcript of discussion)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4786019)