Sciweavers

36 search results - page 4 / 8
» Hash Functions Based on Large Quasigroups
Sort
View
CRYPTO
2001
Springer
117views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Online Ciphers and the Hash-CBC Construction
We initiate a study of on-line ciphers. These are ciphers that can take input plaintexts of large and varying lengths and will output the ith block of the ciphertext after having p...
Mihir Bellare, Alexandra Boldyreva, Lars R. Knudse...
SCN
2004
Springer
123views Communications» more  SCN 2004»
15 years 3 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
ICWS
2009
IEEE
14 years 7 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
PE
2000
Springer
118views Optimization» more  PE 2000»
14 years 9 months ago
A probabilistic dynamic technique for the distributed generation of very large state spaces
Conventional methods for state space exploration are limited to the analysis of small systems because they suffer from excessive memory and computational requirements. We have dev...
William J. Knottenbelt, Peter G. Harrison, Mark Me...
GI
2004
Springer
15 years 3 months ago
Comparison of Load Balancing Algorithms for Structured Peer-to-Peer Systems
Abstract: Among other things, Peer-to-Peer (P2P) systems are very useful for managing large amounts of widely distributed data. Distributed Hash Tables (DHT) offer a highly scalabl...
Simon Rieche, Leo Petrak, Klaus Wehrle