16 citations · 16 across the 4 of their papers we have counts for
5 papers
Finding Collisions in Interactive Protocols -- Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
Iftach Haitner, Jonathan J. Hoch, Omer Reingold +1
We study the round and communication complexities of various cryptographic protocols. We give tight lower bounds on the round and communication complexities of any fully black-box…
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…
Crypto-Oriented Neural Architecture Design
Avital Shafran, Gil Segev, Shmuel Peleg +1
As neural networks revolutionize many applications, significant privacy conflicts between model users and providers emerge. The cryptography community developed a variety of techni…
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
Yuriy Arbitman, Moni Naor, Gil Segev
The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known construct…
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…