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

authenticationCGAclient puzzlesDDoS attacksDoS attacksfairness computation

Mathematics Subject Classification ID

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

Recommendations

• DOS-resistant authentication with client puzzles
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• Security Notions and Generic Constructions for Client Puzzles
• DOS-resistant authentication with client puzzles (transcript of discussion)
• Towards Denial-of-Service-Resilient Key Agreement Protocols

Cited in

(7)

• Cryptographic puzzles and DoS resilience, revisited
• Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols
• Cryptographic salt: A countermeasure against denial-of-service attacks
• A game theoretical model of denial of service attacks on internet
• Security Notions and Generic Constructions for Client Puzzles
• DOS-resistant authentication with client puzzles
• DOS-resistant authentication with client puzzles (transcript of discussion)

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)