Sciweavers

21 search results - page 3 / 5
» Strongly History-Independent Hashing with Applications
Sort
View
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
13 years 11 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
Ernest F. Brickell, David Pointcheval, Serge Vaude...
CRYPTO
2009
Springer
150views Cryptology» more  CRYPTO 2009»
14 years 2 months ago
Short and Stateless Signatures from the RSA Assumption
We present the first signature scheme which is “short”, stateless and secure under the RSA assumption in the standard model. Prior short, standard model signatures in the RSA...
Susan Hohenberger, Brent Waters
SC
2004
ACM
14 years 25 days ago
A Self-Organizing Storage Cluster for Parallel Data-Intensive Applications
Cluster-based storage systems are popular for data-intensive applications and it is desirable yet challenging to provide incremental expansion and high availability while achievin...
Hong Tang, Aziz Gulbeden, Jingyu Zhou, William Str...
ICWS
2009
IEEE
13 years 5 months ago
An Efficient Service Discovery Algorithm for Counting Bloom Filter-Based Service Registry
The Service registry, the yellow pages of ServiceOriented Architecture (SOA), plays a central role in SOAbased service systems. The service registry has to be scalable to manage l...
Shuxing Cheng, Carl K. Chang, Liang-Jie Zhang
P2P
2003
IEEE
108views Communications» more  P2P 2003»
14 years 20 days ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...