Toward non-parallelizable client puzzles

Authors:
Suratose Tritilanunt;Colin Boyd;Ernest Foo;Juan Manuel González Nieto
Affiliations:
Information Security Institute, Queensland University of Technology, Brisbane, QLD, Australia;Information Security Institute, Queensland University of Technology, Brisbane, QLD, Australia;Information Security Institute, Queensland University of Technology, Brisbane, QLD, Australia;Information Security Institute, Queensland University of Technology, Brisbane, QLD, Australia
Venue:
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Year:
2007

Citing 14
Cited 9

Solving low-density subset sum problems

Journal of the ACM (JACM)
Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
Parallel lattice basis reduction

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Improved low-density subset sum algorithms

Computational Complexity
Pricing via Processing or Combatting Junk Mail

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Lattice Basis Reduction: Improved Practical Algorithms and Solving Subset Sum Problems

FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
On breaking generalized knapsack public key cryptosystems

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Defending Against Denial-of-Service Attacks with Puzzle Auctions

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Time-lock Puzzles and Timed-release Crypto

Time-lock Puzzles and Timed-release Crypto
Heuristics on lattice basis reduction in practice

Journal of Experimental Algorithmics (JEA)
New client puzzle outsourcing techniques for DoS resistance

Proceedings of the 11th ACM conference on Computer and communications security
Mitigating Denial of Service Attacks with Password Puzzles

ITCC '05 Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02
Cryptography: An Introduction

Cryptography: An Introduction
Fast LLL-type lattice reduction

Information and Computation

Security Notions and Generic Constructions for Client Puzzles

ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Performance evaluation of non-parallelizable client puzzles for defeating DoS attacks in authentication protocols

DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
Low-cost client puzzles based on modular exponentiation

ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Stronger difficulty notions for client puzzles and denial-of-service-resistant protocols

CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
An integrated approach to cryptographic mitigation of denial-of-service attacks

Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Game theoretic resistance to denial of service attacks using hidden difficulty puzzles

ISPEC'10 Proceedings of the 6th international conference on Information Security Practice and Experience
Secure client puzzles based on random beacons

IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part II
Revisiting difficulty notions for client puzzles and dos resilience

ISC'12 Proceedings of the 15th international conference on Information Security
Publicly verifiable proofs of sequential work

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Client puzzles have been proposed as a useful mechanism for mitigating denial of service attacks on network protocols. Several different puzzles have been proposed in recent years. This paper reviews the desirable properties of client puzzles, pointing out that there is currently no puzzle which satisfies all such properties. We investigate how to provide the property of non-parallelizability in a practical puzzle. After showing that obvious ideas based on hash chains have significant problems, we propose a new puzzle based on the subset sum problem. Despite some practical implementation issues, this is the first example that satisfies all the desirable properties for a client puzzle.