Anti-persistence: History independent data structures

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 492-501

  Naor, Moni ^a   Teague, Vanessa ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b Stanford University   (United States)

Author keywords

Algorithms; Anti persistence; Data structures; Hash table; History independence; Privacy; Security

Indexed keywords

HASH TABLES;

ALGORITHMS; GLOSSARIES; STORAGE ALLOCATION (COMPUTER); TABLE LOOKUP; THEOREM PROVING;

DATA STRUCTURES;

EID: 0034837160     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Ordered hash tables
2. Faster uniquely represented dictionaries
3. Reducing the retrieval time of scatter storage techniques
4. A new universal class of hash functions and dynamic hashing in real time
5. Dynamic perfect hashing: Upper and lower bounds
6. Making data structures persistent
7. Storing a sparse table with o(1) worst case access time
8. Software protection and simulation on oblivious rams
9. The analysis of double hashing
10. Clocked adversaries for hashing
11. More analysis of double hashing
12. Oblivious data structures: Applications to cryptography
13. On aspects of universality and performance for closed hashing
14. Randomized search trees
15. On universal classes of fast high performance hash functions, their time-space tradeoff, and their applications
16. The analysis of closed hashing under limited randomness
17. Uniform hashing is optimal