Corpus ID: 2334364

Practical Client Puzzle from Repeated Squaring

@inproceedings{Jeckmans2009PracticalCP,
  title={Practical Client Puzzle from Repeated Squaring},
  author={Arjan Jeckmans},
  year={2009}
}
Cryptographic puzzles have been proposed by Merkle [15] to relay secret information between parties over an insecure channel. Client puzzles, a type of cryptographic puzzle, have been proposed by Juels and Brainard [8] to defend a server against denial of service attacks. However there is no general framework for client puzzle schemes. In this thesis we present a general client puzzle framework. Since their introduction various types of client puzzles have been devel- oped. One such… Expand
Cryptographic puzzles and DoS resilience, revisited
TLDR
New security definitions for puzzle difficulty are distinguished and formalized which properly define two distinct flavors of puzzle security which are optimality and fairness and in addition, properly define the relation between solving one puzzle versus solving multiple ones. Expand
Revisiting Difficulty Notions for Client Puzzles and DoS Resilience
TLDR
New security definitions for puzzle difficulty are distinguished and formalized and it is shown that the better characterization of hardness for puzzles and DoS resilience allows establishing formal bounds on the effectiveness of client puzzles which confirm previous empirical observations. Expand
Augmenting a Webmail Application with Cryptographic Puzzles to Deflect Spam
  • Marius Cristea, B. Groza
  • Computer Science
  • 2011 4th IFIP International Conference on New Technologies, Mobility and Security
  • 2011
TLDR
In order to increase the resilience against spam, a protocol based on cryptographic puzzles for an open-source web based e-mail client is designed and implemented, which allows the sender of the e-mails to generate the puzzle himself, releasing the E-mail server from an additional computational task. Expand
DNA-based client puzzle for WLAN association protocol against connection request flooding
TLDR
By asking to solve an easy and cost-effective puzzle in OROD puzzle, legitimate users do not suffer from resource exhaustion during puzzle solving, even when under severe DoS attack (high puzzle difficulty). Expand
C2Puzzle: A Novel Computational Client Puzzle for Network Security
Client puzzles, a type of cryptographic puzzle, have been proposed and developed by many scholars to guarantee network security. In this paper, we proposed C2Puzzle, a novel computational clientExpand
Moderately Hard Functions: Definition, Instantiations, and Applications
TLDR
The goal of this work is to provide a (universal) definition that decouples the efforts of designing new moderately hard functions and of building protocols based on them, serving as an interface between the two. Expand
Performance Evaluation of Non-parallelizable Client Puzzles for Defeating DoS Attacks in Authentication Protocols
TLDR
An evaluation of non-parallelizable puzzles used to prevent DoS in authentication protocols based on a simulation and performance analysis helps a responder to resist against DoS, as well as improves the throughput of services for legitimate clients. Expand
AN EXPERIMENTAL STUDY TO PREVENT PACKET HIDING OVER WIRELESS NETWORKS USING AONTS AND SWARM INTELLIGENTALGORITHM
Wireless networks are often vulnerable to all kind of security attacks due to its open structure. i.e. free to join and leave the network. Much of the attacks are formed as intentional interference,Expand
On Non-Parallelizable Deterministic Client Puzzle Scheme with Batch Verification Modes
TLDR
According to the method, the flow measuring operation is initiated as soon as an increase in the flow rate is detected, thus permitting the precise measurement even of very rapid draw-off processes. Expand

References

SHOWING 1-10 OF 21 REFERENCES
Toward Non-parallelizable Client Puzzles
TLDR
After showing that obvious ideas based on hash chains have significant problems, a new puzzle based on the subset sum problem is proposed, and this is the first example that satisfies all the desirable properties for a client puzzle. Expand
New client puzzle outsourcing techniques for DoS resistance
TLDR
New techniques for the use of cryptographic puzzles as a countermeasure to Denial-of-Service (DoS) attacks are explored, with a design that is more resistant to DoS attacks aimed at the puzzle mechanism itself, withstanding over 80% more attack traffic. Expand
On Chained Cryptographic Puzzles
Cryptographic puzzles provide an elegant solution in combating denial of services attacks. In this paper we introduce the concept of chained cryptographic puzzle. We define two kinds of chainedExpand
Efficient Memory Bound Puzzles Using Pattern Databases
TLDR
This paper investigates the applicability of memory bound puzzles from a new perspective and proposes constructions based on heuristic search methods that allow for easily tune parameters that impact puzzle creation and verification costs and addresses client-side cost. Expand
Client Puzzles Based on Quasi Partial Collisions Against DoS Attacks in UMTS
TLDR
This paper proposes a method based on partial collisions in hash functions that provides fine-grained control over difficulties by introducing a quasi partial collision concept and results obtained confirm the fine granularity and efficiency of the approach. Expand
Design and implementation of network puzzles
  • W. Feng, E. Kaiser, A. Luu
  • Computer Science
  • Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
TLDR
Modifications to existing puzzle protocols that allow them to work at the network layer are described, a hint-based hash-reversal puzzle that allows for the generation and verification of fine-grained puzzles at line speed in the fast path of high-speed routers, and an iptables implementation that supports transparent deployment at arbitrary locations in the network. Expand
DOS-Resistant Authentication with Client Puzzles
TLDR
It is shown how stateless authentication protocols and the client puzzles of Juels and Brainard can be used to prevent denial of service by server resource exhaustion. Expand
\Proof-of-Work" Proves Not to Work
TLDR
It is concluded that proof-of-work will not be a solution to the problem of spam because spammers can access insecure end-user machines and will steal processing cycles to solve puzzles. Expand
Wireless client puzzles in IEEE 802.11 networks: security by wireless
TLDR
This work introduces the concept of wireless client puzzles, a protection method which assists an AP to preserve its resources by discarding fake requests, while allowing legitimate clients to successfully join the network. Expand
Time-lock Puzzles and Timed-release Crypto
Our motivation is the notion of ``timed-release crypto,'''' where the goal is to encrypt a message so that it can not be decrypted by anyone, not even the sender, until a pre-determined amount ofExpand
...
1
2
3
...