3 papers
math.PR2023
Mixing Time of the Overlapping Cycles Shuffle
Olena Blumberg, Ben Morris, Hans Oberschelp
In each step of the overlapping cycles shuffle on cards, a fair coin is flipped which determines whether the th card or the th card is moved to the top of the deck. Angel…
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…
cs.CR2022
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…