scientific article; zbMATH DE number 1844586

MaRDI QIDQ4786019zbMATH OpenFDO

Authors Tuomas Aura

Publication date 12 December 2002

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1844585
• 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)

• scientific article; zbMATH DE number 1947509 (Why is no real title available?)
• scientific article; zbMATH DE number 1844585 (Why is no real title available?)
• scientific article; zbMATH DE number 1844584 (Why is no real title available?)
• Towards Denial-of-Service-Resilient Key Agreement Protocols
• Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
• The moderately hard DoS-resistant authentication protocol on client puzzles
• Security Notions and Generic Constructions for Client Puzzles
• scientific article; zbMATH DE number 1808271 (Why is no real title available?)

This page was built for publication:

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