A Probabilistic Proof of the nCPA to CCA Bound. - Ben Morris 001; Hans Oberschelp (CoRR, 2022)

Format Preserving Encryption in the Bounded Retrieval Model. - Ben Morris 001; Hans Oberschelp; Hamilton Samraj Santhakumar (CoRR, 2023)

Mixing Times of the Swap-or-Not and Overlapping Cycles Shuffles - Hans Oberschelp (2023)