Sciweavers

4 search results - page 1 / 1
» Remote Algorithmic Complexity Attacks against Randomized Has...
Sort
View
53
Voted
SECRYPT
2007
77views Business» more  SECRYPT 2007»
14 years 11 months ago
Remote Algorithmic Complexity Attacks against Randomized Hash Tables
Noa Bar-Yosef, Avishai Wool
IPTPS
2003
Springer
15 years 2 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder
SPAA
2006
ACM
15 years 3 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
JOC
2000
181views more  JOC 2000»
14 years 9 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern