38 citations · 85 across the 17 of their papers we have counts for
19 papers
Format Preserving Encryption in the Bounded Retrieval Model
Ben Morris, Hans Oberschelp, Hamilton Samraj Santhakumar
In the bounded retrieval model, the adversary can leak a certain amount of information from the message sender's computer (e.g., 10 percent of the hard drive). Bellare, Kane and Ro…
Transience of Simple Random Walks With Linear Entropy Growth
Ben Morris, Hamilton Samraj Santhakumar
Using the technique of evolving sets, we explore the connection between entropy growth and transience for simple random walks on connected infinite graphs with bounded degree. In p…
A Probabilistic Proof of the nCPA to CCA Bound
Ben Morris, Hans Oberschelp
We provide a new proof of Maurer, Renard, and Pietzak's result that the sum of the nCPA advantages of random permutations and bound the CCA advantage of . O…
The social network model on infinite graphs
Jonathan Hermon, Ben Morris, Chuan Qin +1
Given an infinite connected regular graph , place at each vertex Pois() walkers performing independent lazy simple random walks on simultaneously. When two walkers…
Transience in growing subgraphs via evolving sets
Amir Dembo, Ruojun Huang, Ben Morris +1
We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly laz…
How many queries are needed to distinguish a truncated random permutation from a random function?
Shoni Gilboa, Shay Gueron, Ben Morris
An oracle chooses a function from the set of bits strings to itself, which is either a randomly chosen permutation or a randomly chosen function. When queried by an -bit…