History-independent cuckoo hashing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5126 LNCS, Issue PART 2, 2008, Pages 631-642

  Naor, Moni ^a   Segev, Gil ^a   Wieder, Udi ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SCIENCE; COMPUTER SYSTEMS; ERROR ANALYSIS; FILE ORGANIZATION; HISTORY; LINGUISTICS; TRANSLATION (LANGUAGES); WEIGHT CONTROL;

CONSTANT TIME; DYNAMIC MEMORY ALLOCATION; HIGH PROBABILITY; INSERTIONS AND DELETIONS; LOOKUP TIME; MEMBERSHIP QUERIES; MEMORY UTILIZATION; WORST CASE;

DATA STRUCTURES;

EID: 49049090158     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70583-3_51     Document Type: Conference Paper

References (29)

1. Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4-5), 434-449 (1996)
2. Bellare, M., Goldreich, O., Goldwasser, S.: Incremental Cryptography: The Case of Hashing and Signing. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 216-233. Springer, Heidelberg (1994)
3. Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography and application to virus protection. In: 27th STOC, pp. 45-56 (1995)
4. Bethencourt, J., Boneh, D., Waters, B.: Cryptographic methods for storing ballots on a voting machine. In: 14th NDSS, pp. 209-222 (2007)
5. Blelloch, G.E., Golovin, D.: Strongly history-independent hashing with applications. In: 48th FOCS, pp. 272-282 (2007)
6. Buchbinder, N., Petrank, E.: Lower and upper bounds on obtaining history-independence. Inf. Comput. 204(2), 291-337 (2006)
7. Dietzfelbinger, M., Karlin, A.R., Mehlhorn, K., auf der Heide, F.M., Rohnert, H., Tarjan, R.E.: Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput. 23(4), 738-761 (1994)
8. Dietzfelbinger, M., Weidling, C.: Balanced allocation and dictionaries with tightly packed constant size bins. Theor. Comput. Sci. 380(1-2), 47-68 (2007)
9. Dietzfelbinger, M., Woelfel, P.: Almost random graphs with simple hash functions. In: 35th STOC, pp. 629-638 (2003)
10. Erlingsson, Ú., Manasse, M., McSherry, F.: A cool and practical alternative to traditional hash tables. In: 7th Workshop on Distributed Data and Structures (2006)
11. Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.G.: Space efficient hash tables with worst case constant access time. Theor. Comput. Sys. 38(2), 229-248 (2005)
12. Fredman, M.L., Komlós, J., Szemerédi, E.: Storing a sparse table with O(1) worst case access time. J. ACM 31(3), 538-544 (1984)
13. Hagerup, T., Miltersen, P.B., Pagh, R.: Deterministic dictionaries. J. Algorithms 41(1), 69-85 (2001)
14. Hartline, J.D., Hong, E.S., Mohr, A.E., Pentney, W.R., Rocke, E.: Characterizing history independent data structures. Algorithmica 42(1), 57-74 (2005)
15. Janson, S., ŁLuczak, T., Ruciński, A.: Random Graphs. Wiley-Interscience, Chichester (2000)
16. Kirsch, A., Mitzenmacher, M., Wieder, U.: More robust hashing: Cuckoo hashing with a stash (manuscript, 2008)
17. Kutzelnigg, R.: Bipartite random graphs and cuckoo hashing. In: 4th Colloquium on Mathematics and Computer Science, pp. 403-406 (2006)
18. Micciancio, D.: Oblivious data structures: Applications to cryptography. In: 29th STOC, pp. 456-464 (1997)
19. Miltersen, P.B.: Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In: 9th SODA, pp. 556-563 (1998)
20. Mitzenmacher, M., Vadhan, S.: Why simple hash functions work: Exploiting the entropy in a data stream. In: 19th SODA, pp. 746-755 (2008)
21. Molnar, D., Kohno, T., Sastry, N., Wagner, D.: Tamper-evident, history-independent, subliminal-free data structures on PROM storage -or- How to store ballots on a voting machine. In: IEEE S&P, pp. 365-370 (2006)
22. Moran, T., Naor, M., Segev, G.: Deterministic history-independent strategies for storing information on write-once memories. In: 34th ICALP, pp. 303-315 (2007)
23. Naor, M., Teague, V.: Anti-persistence: History independent data structures. In: 33rd STOC, pp. 492-501 (2001)
24. Ostlin, A., Pagh, R.: Uniform hashing in constant time and linear space. In: 35th STOC, pp. 622-628 (2003)
25. Pagh, R., Rodler, F.F.: Cuckoo hashing. J. of Algorithms 51(2), 122-144 (2004)
26. Panigrahy, R.: Efficient hashing with lookups in two memory accesses. In: 16th SODA, pp. 830-839 (2005)
27. Ross, K.A.: Efficient hash probes on modern processors. In: 23nd International Conference on Data Engineering, pp. 1297-1301 (2007)
28. Siegel, A.: On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications. In: 30th FOCS, pp. 20-25 (1989)
29. Zukowski, M., Héman, S., Boncz, P.A.: Architecture conscious hashing. In: 2nd International Workshop on Data Management on New Hardware, vol. 6 (2006)