Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Making data structures persistent
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On aspects of university and performance for closed hashing
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A new universal class of hash functions and dynamic hashing in real time
Proceedings of the seventeenth international colloquium on Automata, languages and programming
The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Faster uniquely represented dictionaries
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Oblivious data structures: applications to cryptography
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Reducing the retrieval time of scatter storage techniques
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Characterizing History Independent Data Structures
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Integrating security across the computer science curriculum
Journal of Computing Sciences in Colleges
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Lower and upper bounds on obtaining history independence
Information and Computation
Threats to privacy in the forensic analysis of database systems
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Uniquely Represented Data Structures for Computational Geometry
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Replayable voting machine audit logs
EVT'08 Proceedings of the conference on Electronic voting technology
B-Treaps: A Uniquely Represented Alternative to B-Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Lower and upper bounds on obtaining history independence
Information and Computation
Super-efficient aggregating history-independent persistent authenticated dictionaries
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
IEEE Transactions on Information Technology in Biomedicine
Divide and discriminate: algorithm for deterministic and fast hash lookups
Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Authenticated Dictionaries: Real-World Costs and Trade-Offs
ACM Transactions on Information and System Security (TISSEC)
History-independence: a fresh look at the case of R-trees
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Deterministic history-independent strategies for storing information on write-once memories
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
HIFS: history independence for file systems
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Hi-index | 0.00 |
Many data structures give away much more information than they were intended to. Whenever privacy is important, we need to be concerned that it might be possible to infer information from the memory representation of a data structure that is not available through its “legitimate” interface. Word processors that quietly maintain old versions of a document are merely the most egregious example of a general problem.We deal with data structures whose current memory representation does not reveal their history. We focus on dictionaries, where this means revealing nothing about the order of insertions or deletions. Our first algorithm is a hash table based on open addressing, allowing O(1) insertion and search. We also present a history independent dynamic perfect hash table that uses space linear in the number of elements inserted and has expected amortized insertion and deletion time O(1). To solve the dynamic perfect hashing problem we devise a general scheme for history independent memory allocation. For fixed-size records this is quite efficient, with insertion and deletion both linear in the size of the record. Our variable-size record scheme is efficient enough for dynamic perfect hashing but not for general use. The main open problem we leave is whether it is possible to implement a variable-size record scheme with low overhead.