Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. Hover, the wide disparity in CPU speeds prevents such puzzles from being globally deployed. Recently, Abadi et. al. [1] and Dwork et. al. [2] addressed this limitation by showing that memory access times vary much less than CPU speeds, and hence offer a viable alternative. ,  further investigate the applicability of memory bound puzzles from a new perspective and propose constructions based on heuristic search methods. Our constructions are derived from a more algorithmic foundation, and as a result, allow us to easily tune parameters that impact puzzle creation and verification costs. Moreover, unlike prior approaches,  address client-side cost and present an extension that allows memory constrained clients (e.g., PDAs) to implement our construction in a secure fashion.
['Sujata Doshi', 'Fabian Monrose', 'Aviel D. Rubin']
I am writing a research paper on a idea Efficient memory bound puzzles using pattern databases
[{"from": "human", "value": "I am writing a research paper on a idea Efficient memory bound puzzles using pattern databases"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: CPU bound client puzzles have been suggested as a defense mechanism against connection depletion attacks. Hover, the wide disparity in CPU speeds prevents such puzzles from being globally deployed. Recently, Abadi et. al. [1] and Dwork et. al. [2] addressed this limitation by showing that memory access times vary much less than CPU speeds, and hence offer a viable alternative. ,  further investigate the applicability of memory bound puzzles from a new perspective and propose constructions based on heuristic search methods. Our constructions are derived from a more algorithmic foundation, and as a result, allow us to easily tune parameters that impact puzzle creation and verification costs. Moreover, unlike prior approaches,  address client-side cost and present an extension that allows memory constrained clients (e.g., PDAs) to implement our construction in a secure fashion."}]