2 papers
cs.CR2023
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…
math.PR2023
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…