Results 1 - 10 of 32

DOS-resistant authentication with client puzzles

by Tuomas Aura, Pekka Nikander, Jussipekka Leiwo - Lecture Notes in Computer Science , 2000
"... Abstract. Denial of service by server resource exhaustion has become a major security threat in open communications networks. Public-key authentication does not completely protect against the attacks because the authentication protocols often leave ways for an unauthenticated client to consume a ser ..."
Abstract - Cited by 183 (4 self) - Add to MetaCart
server’s memory space and computational resources by initiating a large number of protocol runs and inducing the server to perform expensive cryptographic computations. We show how stateless authentication protocols and the client puzzles of Juels and Brainard can be used to prevent such attacks. 1

Threshold puzzles: The evolution of DoS-resistant authentication

by Valer Bocan - Periodica Politechnica, Transactions on Automatic Control and Computer Science 49(63) (2004) Memory Bound Puzzles Using Pattern Databases 113
"... Abstract – Client puzzles have been proposed to add DOS resistance to authentication protocols. Due to the parallel design of puzzles, the technology is vulnerable to the socalled strong attacks. This paper advocates the need for time management of solved puzzle instances and introduces the “thresho ..."
Abstract - Cited by 3 (0 self) - Add to MetaCart
Abstract – Client puzzles have been proposed to add DOS resistance to authentication protocols. Due to the parallel design of puzzles, the technology is vulnerable to the socalled strong attacks. This paper advocates the need for time management of solved puzzle instances and introduces

Revisiting Difficulty Notions For Client Puzzles

by Dos Resilience, Bogdan Groza, Bogdan Warinschi
"... Abstract. Cryptographic puzzles are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a first step towards rigor ..."
Abstract - Add to MetaCart
) and suggest an alternative definition. Our results are not only of theoretical interest. We show that our better charac-terization of hardness for puzzles and DoS resilience allows establishing formal bounds on the effectiveness of client puzzles which confirm previous empirical observations. 1

Secure Client Puzzles Based on Random Beacons

by Yves Igor Jerschow, Martin Mauve
"... Abstract. Denial of Service (DoS) attacks pose a fast-growing threat to network services in the Internet, but also corporate Intranets and public local area networks like Wi-Fi hotspots may be affected. Especially protocols that perform authentication and key exchange relying on expensive public key ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. Denial of Service (DoS) attacks pose a fast-growing threat to network services in the Internet, but also corporate Intranets and public local area networks like Wi-Fi hotspots may be affected. Especially protocols that perform authentication and key exchange relying on expensive public

Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots

by Yves Igor Jerschow, Martin Mauve
"... Abstract—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely on public key cryptography and perform expensive authentication handshakes may be an easy target. A well-known coun ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
puzzle scheme by introducing a bandwidth-based cost factor for the client. Keywords—client puzzles, Denial of Service (DoS), network protocols, authentication, computational puzzles

Modular Square Root Puzzles: Design of Non-Parallelizable and Non-Interactive Client Puzzles

by Yves Igor Jerschow , Martin Mauve , 2012
"... Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely on public key cryptography and perform expensive authentication handshakes may be an easy target. A well-known countermeasur ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely on public key cryptography and perform expensive authentication handshakes may be an easy target. A well

Cryptographic puzzles and dos resilience, revisited

by Bogdan Groza, Bogdan Warinschi - Designs, Codes and Cryptography , 2013
"... Abstract. Cryptographic puzzles (or client puzzles) are moderately difficult problems that can be solved by investing non-trivial amounts of computation and/or storage. Devising models for cryptographic puzzles has only recently started to receive attention from the cryptographic community as a firs ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
first step toward rigorous models and proofs of security of applications that employ them (e.g. Denial-of-Service (DoS) resistance). Unfortunately, the subtle interaction between the complex scenarios for which cryptographic puzzles are intended and typical difficulties associated with defining concrete

Efficient Modular Exponentiation-based Puzzles for Denial-of-Service Protection

by Jothi Rangasamy, Douglas Stebila, Colin Boyd, Juan Gonzalez Nieto
"... Abstract. Client puzzles are moderately-hard cryptographic problems — neither easy nor impossible to solve — that can be used as a countermeasure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties such a ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
Abstract. Client puzzles are moderately-hard cryptographic problems — neither easy nor impossible to solve — that can be used as a countermeasure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties

Secure and Authenticated Source Routing in i Wireless Networks

by Dhiraj Khurana, Mukesh Singla
"... Wireless networking is today’s glamour technology. We can hardly pick up a technology publication without encountering articles extolling its virtues or excoriating its faults. Wireless networking refers to technology that enables two or more computers to communicate using standard network protocols ..."
Abstract - Add to MetaCart
Wireless networking is today’s glamour technology. We can hardly pick up a technology publication without encountering articles extolling its virtues or excoriating its faults. Wireless networking refers to technology that enables two or more computers to communicate using standard network

Cryptographic Voting Protocols A Prototype Design and Implementation for University Elections at TU Darmstadt

by Alexander Klink, Betreut Von Evangelos Karatsiolis, Technische Universität Darmstadt, Fachbereich Informatik, Fachgebiet Theoretische Informatik
"... I would like to thank some people who were involved in the creation of this thesis: • Berry Schoenmakers of TU Eindhoven for introducing me to the topic of cryptographic voting protocols. • Evangelos Karatsiolis for his work in guiding me through the process of writing this thesis and his constant m ..."
Abstract - Add to MetaCart
I would like to thank some people who were involved in the creation of this thesis: • Berry Schoenmakers of TU Eindhoven for introducing me to the topic of cryptographic voting protocols. • Evangelos Karatsiolis for his work in guiding me through the process of writing this thesis and his constant
Results 1 - 10 of 32