Strongly History-Independent Hashing with Applications

Blelloch, Guy E.; Golovin, Daniel

doi:10.1109/focs.2007.36

Cited by 43 publications

(35 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Uniquely represented data structures have been considered before in the algorithms and complexity communities, by Golovin [15], Naor and Teague [25] and others [8,16,20,30]. In each of these cases, the data structures were motivated by the need to prevent an observer with access to the final state of a computation from reconstructing its history, and thus uncovering information that should remain private.…”

Section: Introductionmentioning

confidence: 99%

Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures

Stewart

Banerjee

Nanevski

2013

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

We consider verification of information flow and erasure properties in programs with heterogeneous heap-based data structures, in the presence of procedures with local state. A heterogeneous data structure, such as a hash table implementing a medical record database, may store both secret and public data simultaneously. In contrast, extant work primarily focuses on homogeneous data structures which store data of a uniform security level. Heterogeneity, however, does not come for free. For example, standard implementations of hash tables do not support heterogeneity, and may leak sensitive information easily owing to hash collisions. In this paper we identify unique representation as a sufficient condition for a heterogeneous data structure to be leak-free, while simultaneously supporting abstraction and modularity in verification. As a case study, we implement and verify a novel uniquely-represented variant of heterogeneous hash tables. Furthermore, we demonstrate modular reasoning by showing how specifications of the hash table methods can be used in a client application; we thereby obtain abstract and concise formal proofs of erasure. We formalize our work in Relational Hoare Type Theory (RHTT), an expressive, higherorder imperative language and program logic embedded in the Coq proof assistant.

show abstract

Section: Introductionmentioning

confidence: 99%

Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures

Stewart

Banerjee

Nanevski

2013

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

View full text Add to dashboard Cite

show abstract

“…We obtain the same bounds as the second construction of Blelloch and Golovin [5] (see Section 1.1). The main advantages of our construction are its simplicity and practicality: membership queries would mostly require only two independent memory probes, and updates are performed in a way which is almost similar to cuckoo hashing and thus is very fast.…”

Section: Our Contributionsmentioning

confidence: 57%

“…Blelloch and Golovin [5] constructed two strongly history-independent data structures based on linear probing. Their first construction supports insertions, deletions and membership queries in expected constant time.…”

Section: Related Workmentioning

confidence: 99%

“…When dealing with strongly history-independent data structures, a canonical representation for each set of elements must be determined at the initialization phase of the data structure. Therefore, all the hash functions must be chosen in advance, and this may lead to a high storage overhead (as is the case in [5]). Secondly, if an element that causes a rehash is inserted and deleted multiple times, each time an entire rehash must be performed.…”

Section: Overview Of the Constructionmentioning

confidence: 99%

“…One possibility is using the strongly history-independent data structure of Blelloch and Golovin [5], and in this case our data structure supports insertions and deletions in expected constant time, and membership queries in worst case constant time. Another possibility is using any deterministic perfect hash table with constant lookup time.…”

Section: The Secondary Data Structurementioning

confidence: 99%

See 2 more Smart Citations

History-Independent Cuckoo Hashing

Naor

Segev

Wieder

Automata, Languages and Programming

View full text Add to dashboard Cite

Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case constant lookup time, and good memory utilization. Various experiments demonstrated that cuckoo hashing is highly suitable for modern computer architectures and distributed settings, and offers significant improvements compared to other schemes.In this work we construct a practical history-independent dynamic dictionary based on cuckoo hashing. In a history-independent data structure, the memory representation at any point in time yields no information on the specific sequence of insertions and deletions that led to its current content, other than the content itself. Such a property is significant when preventing unintended leakage of information, and was also found useful in several algorithmic settings.Our construction enjoys most of the attractive properties of cuckoo hashing. In particular, no dynamic memory allocation is required, updates are performed in expected amortized constant time, and membership queries are performed in worst case constant time. Moreover, with high probability, the lookup procedure queries only two memory entries which are independent and can be queried in parallel. The approach underlying our construction is to enforce a canonical memory representation on cuckoo hashing. That is, up to the initial randomness, each set of elements has a unique memory representation.

show abstract