Towards a security model for computational puzzle schemes

Tang, Qiang; Jeckmans, Arjan

doi:10.1080/00207160.2010.543951

Cited by 4 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar concept is given by Dwork and Naor [9] with the notion of pricing function to combat junk emails, and by Rivest, Shamir, and Wagner [17] with the notion of timed-lock puzzle as a tool to realize timedrelease crypto. Client puzzles are expected to be unforgeable and difficult to solve [18] and possibly to have determinable difficulty and parallel computation resistance [19].…”

Section: Related Workmentioning

confidence: 99%

Hashcash Tree, a Data Structure to Mitigate Denial-of-Service Attacks

Alviano

2023

Algorithms

View full text Add to dashboard Cite

Client puzzle protocols are widely adopted mechanisms for defending against resource exhaustion denial-of-service (DoS) attacks. Among the simplest puzzles used by such protocols, there are cryptographic challenges requiring the finding of hash values with some required properties. However, by the way hash functions are designed, predicting the difficulty of finding hash values with non-trivial properties is impossible. This is the main limitation of simple proof-of-work (PoW) algorithms, such as hashcash. We propose a new data structure combining hashcash and Merkle trees, also known as hash trees. In the proposed data structure, called hashcash tree, all hash values are required to start with a given number of zeros (as for hashcash), and hash values of internal nodes are obtained by hashing the hash values of child nodes (as for hash trees). The client is forced to compute all hash values, but only those in the path from a leaf to the root are required by the server to verify the proof of work. The proposed client puzzle is implemented and evaluated empirically to show that the difficulty of puzzles can be accurately controlled.

show abstract

Section: Related Workmentioning

confidence: 99%

Hashcash Tree, a Data Structure to Mitigate Denial-of-Service Attacks

Alviano

2023

Algorithms

View full text Add to dashboard Cite

show abstract

“…They have mentioned in their research work that not only wired networks, but also wireless networks are prone to DDoS attacks. Qiang Tang et.al have proposed a security architecture where he concentrated on two properties, regarding the determinable difficulty and the parallel computation resistance [5]. Yves Igor et.al introduces a client puzzle mechanism where the generation of puzzle is dependent on calculating of square roots modulo with a prime [6].…”

Section: Literature Surveymentioning

confidence: 99%

Reducing distributed denial of service (DDoS) attacks using client puzzle mechanism

Krishna¹,

Bhuvana²,

Kumar³

et al. 2017

IJET

View full text Add to dashboard Cite

In a typical DoS attack, the attacker tries to bring the server down. In this case, the attacker sends a lot of bogus queries to the server to consume its computing power and bandwidth. As the server’s bandwidth and computing power are always greater than attacker’s client machine, He seeks help from a group of connected computers. DDoS attack involves a lot of client machines which are hijacked by the attacker (together called as botnet). As the server handles all these requests sent by the attacker, all its resources get consumed and it cannot provide services. In this project, we are more concerned about reducing the computing power on the server side by giving the client a puzzle to solve. To prevent such attacks, we use client puzzle mechanism. In this mechanism, we introduce a client-side puzzle which demands the machine to perform tasks that require more resources (computation power). The client’s request is not directly sent to the server. Moreover, there will be an Intermediate Server to monitor all the requests that are being sent to the main server. Before the client’s request is sent to the server, it must solve a puzzle and send the answer. Intermediate Server is used to validate the answer and give access to the client or block the client from accessing the server.

show abstract

“…Malicious Users [7] [8] [9] 5 Conclusion Figure 1: Outline of the thesis Most existing secure computation protocols for recommender systems require interaction between the service provider and its users, which makes unavailability of users a serious issue (particularly in the case of collaborative filtering). When this issue is not addressed, the efficiency of the recommender system becomes dependent on the availability of the users.…”

Section: Research Questionsmentioning

confidence: 99%

Cryptographically-enhanced privacy for recommender systems

Jeckmans¹

View full text Add to dashboard Cite

Towards a security model for computational puzzle schemes

Cited by 4 publications

References 29 publications

Hashcash Tree, a Data Structure to Mitigate Denial-of-Service Attacks

Hashcash Tree, a Data Structure to Mitigate Denial-of-Service Attacks

Reducing distributed denial of service (DDoS) attacks using client puzzle mechanism

Cryptographically-enhanced privacy for recommender systems

Contact Info

Product

Resources

About