Sciweavers

SODA
2008
ACM
110views Algorithms» more  SODA 2008»
14 years 26 days ago
Why simple hash functions work: exploiting the entropy in a data stream
Hashing is fundamental to many algorithms and data structures widely used in practice. For theoretical analysis of hashing, there have been two main approaches. First, one can ass...
Michael Mitzenmacher, Salil P. Vadhan
ASIACRYPT
2000
Springer
14 years 3 months ago
Security of Signed ElGamal Encryption
Assuming a cryptographically strong cyclic group G of prime order q and a random hash function H, we show that ElGamal encryption with an added Schnorr signature is secure against ...
Claus-Peter Schnorr, Markus Jakobsson
PODS
2010
ACM
206views Database» more  PODS 2010»
14 years 4 months ago
Cache-oblivious hashing
The hash table, especially its external memory version, is one of the most important index structures in large databases. Assuming a truly random hash function, it is known that i...
Rasmus Pagh, Zhewei Wei, Ke Yi, Qin Zhang