Improved bounds for sampling contingency tables. - Ben J. Morris (Random Struct. Algorithms, 2002)

Evolving sets and mixin. - Ben Morris 001; Yuval Peres (STOC, 2003)

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. - Ben Morris 001; Alistair Sinclair (SIAM J. Comput., 2004)

The Mixing Time of the Thorp Shuffle. - Ben Morris 001 (SIAM J. Comput., 2008)

How to Encipher Messages on a Small Domain. - Ben Morris 001; Phillip Rogaway; Till Stegers (CRYPTO, 2009)

An Enciphering Scheme Based on a Card Shuffle. - Viet Tung Hoang; Ben Morris 001; Phillip Rogaway (CRYPTO, 2012)

Improved Mixing Time Bounds for the Thorp Shuffle. - Ben Morris 001 (Comb. Probab. Comput., 2013)

Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time. - Ben Morris 001; Phillip Rogaway (IACR Cryptol. ePrint Arch., 2013)

How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function? - Shoni Gilboa; Shay Gueron; Ben Morris 001 (J. Cryptol., 2018)

Deterministic Encryption with the Thorp Shuffle. - Ben Morris 001; Phillip Rogaway; Till Stegers (J. Cryptol., 2018)

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)