Introduced less than twenty years ago, cuckoo hashing has a number of attractive features like a constant worst case number of memory accesses for queries and close to full memory utilization. Cuckoo hashing has been widely adopted to perform exact matching of an incoming key with a set of stored (key, value) pairs in both software and hardware implementations. This widespread adoption makes it important to consider the security of cuckoo hashing. Most hash based data structures can be attacked by generating collisions that reduce their performance. In fact, for cuckoo hashing collisions could lead to insertion failures which in some systems would lead to a system failure. For example, if cuckoo hashing is used to perform Ethernet lookup an...
Directories used for cache coherence are vulnerable to side channel attacks. Directories are inclusi...
Abstract—The design of computer and communication systems has been based, for decades, on the fundam...
We describe Coral, a counterexample finder for incorrect inductive conjectures. By devising a first-...
Part 3: Reliability and ResilienceInternational audiencePeacock and Cuckoo hashing schemes are curre...
Cuckoo hashing is a powerful primitive that enables storing items using small space with efficient q...
Cuckoo hashing holds great potential as a high-performance hashing scheme for real appli-cations. Up...
This paper presents a lock-free cuckoo hashing algorithm; to the best of our knowledge this is the fi...
Abstract Cyberthreats continue their expansion, becoming more and more complex and varied. However, ...
International audienceCuckoo hashing is a common hashing technique, guaranteeing constant-time looku...
There once was a table of hashes That held extra items in stashes It all seemed like bliss But thing...
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion ...
Title from PDF of title page viewed January 8, 2018Thesis advisor: Yijie HanVitaIncludes bibliograph...
The Snowden revelations of 2013 have shed some light on the extent of state-performed mass surveilla...
In this work, we study and formalize security notions for algorithm substitution attacks (ASAs) on e...
The cuckoo filter data structure of Fan, Andersen, Kaminsky, and Mitzenmacher (CoNEXT 2014) performs...
Directories used for cache coherence are vulnerable to side channel attacks. Directories are inclusi...
Abstract—The design of computer and communication systems has been based, for decades, on the fundam...
We describe Coral, a counterexample finder for incorrect inductive conjectures. By devising a first-...
Part 3: Reliability and ResilienceInternational audiencePeacock and Cuckoo hashing schemes are curre...
Cuckoo hashing is a powerful primitive that enables storing items using small space with efficient q...
Cuckoo hashing holds great potential as a high-performance hashing scheme for real appli-cations. Up...
This paper presents a lock-free cuckoo hashing algorithm; to the best of our knowledge this is the fi...
Abstract Cyberthreats continue their expansion, becoming more and more complex and varied. However, ...
International audienceCuckoo hashing is a common hashing technique, guaranteeing constant-time looku...
There once was a table of hashes That held extra items in stashes It all seemed like bliss But thing...
In this paper, we provide a polylogarithmic bound that holds with high probability on the insertion ...
Title from PDF of title page viewed January 8, 2018Thesis advisor: Yijie HanVitaIncludes bibliograph...
The Snowden revelations of 2013 have shed some light on the extent of state-performed mass surveilla...
In this work, we study and formalize security notions for algorithm substitution attacks (ASAs) on e...
The cuckoo filter data structure of Fan, Andersen, Kaminsky, and Mitzenmacher (CoNEXT 2014) performs...
Directories used for cache coherence are vulnerable to side channel attacks. Directories are inclusi...
Abstract—The design of computer and communication systems has been based, for decades, on the fundam...
We describe Coral, a counterexample finder for incorrect inductive conjectures. By devising a first-...