The moderately hard DoS-resistant authentication protocol on client puzzles

MaRDI QIDQ4640236zbMATH OpenFDO

Authors Min-Shiang Hwang, Song-Kong Chong, Hsia-Hung Ou

Publication date 17 May 2018

Full work available at URL https://content.iospress.com/articles/informatica/inf1088

zbMATH Keywords

authenticationDDoS attacksDoS attacksclient puzzlesCGAfairness computation

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 1844585
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• Security Notions and Generic Constructions for Client Puzzles
• scientific article; zbMATH DE number 1844586
• Towards Denial-of-Service-Resilient Key Agreement Protocols

Cited in

(7)

• A game theoretical model of denial of service attacks on internet
• scientific article; zbMATH DE number 1844585 (Why is no real title available?)
• scientific article; zbMATH DE number 1844586 (Why is no real title available?)
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• Cryptographic puzzles and DoS resilience, revisited
• 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: The moderately hard DoS-resistant authentication protocol on client puzzles

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