SODA
2008
ACM
13 years 6 months ago
2008
ACM
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...
ASIACRYPT
2000
Springer
13 years 9 months ago
2000
Springer
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 ...
PODS
2010
ACM
13 years 9 months ago
2010
ACM
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...