The moderately hard DoS-resistant authentication protocol on client puzzles

zbMATH Open1387.68036MaRDI QIDQ4640236FDOQ4640236

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

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

zbMATH Keywords

authenticationDDoS attacksDoS attacksclient puzzlesCGAfairness computation

Mathematics Subject Classification ID

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

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A game theoretical model of denial of service attacks on internet

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)