2 papers
cs.IT2020
An Information-Theoretic Proof of the Streaming Switching Lemma for Symmetric Encryption
Ido Shahaf, Or Ordentlich, Gil Segev
Motivated by a fundamental paradigm in cryptography, we consider a recent variant of the classic problem of bounding the distinguishing advantage between a random function and a ra…
cs.DS2009
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
Yuriy Arbitman, Moni Naor, Gil Segev
Cuckoo hashing is a highly practical dynamic dictionary: it provides amortized constant insertion time, worst case constant deletion time and lookup time, and good memory utilizati…