Ben Morris

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 5

Top Topics

Retrieval Model

Trec Collections

Randomly Generated

Language Learning

Top Venues

Comb. Probab. Comput.

IACR Cryptol. ePrint Arch.

Publications

Ben Morris, Hans Oberschelp, Hamilton Samraj Santhakumar
Format Preserving Encryption in the Bounded Retrieval Model. CoRR (2023)
Ben Morris, Hans Oberschelp
A Probabilistic Proof of the nCPA to CCA Bound. CoRR (2022)
Ben Morris, Phillip Rogaway, Till Stegers
Deterministic Encryption with the Thorp Shuffle. J. Cryptol. 31 (2) (2018)
Shoni Gilboa, Shay Gueron, Ben Morris
How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function? J. Cryptol. 31 (1) (2018)
Ben Morris, Daniel Yurovsky
Communicative pressure can lead to input that supports language learning. CogSci (2018)
Ben Morris, Phillip Rogaway
Sometimes-Recurse Shuffle - Almost-Random Permutations in Logarithmic Expected Time. EUROCRYPT (2014)
Shoni Gilboa, Shay Gueron, Ben Morris
How many queries are needed to distinguish a truncated random permutation from a random function? CoRR (2014)
Ben Morris, Phillip Rogaway
Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time. IACR Cryptol. ePrint Arch. 2013 (2013)
Ben Morris
Improved Mixing Time Bounds for the Thorp Shuffle. Comb. Probab. Comput. 22 (1) (2013)
Viet Tung Hoang, Ben Morris, Phillip Rogaway
An Enciphering Scheme Based on a Card Shuffle CoRR (2012)
Viet Tung Hoang, Ben Morris, Phillip Rogaway
An Enciphering Scheme Based on a Card Shuffle. CRYPTO (2012)
Ben Morris, Phillip Rogaway, Till Stegers
How to Encipher Messages on a Small Domain. CRYPTO (2009)
Ben Morris
The Mixing Time of the Thorp Shuffle. SIAM J. Comput. 38 (2) (2008)
Ben Morris
The mixing time of the Thorp shuffle. STOC (2005)
Ben Morris, Alistair Sinclair
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. SIAM J. Comput. 34 (1) (2004)
Ben Morris, Yuval Peres
Evolving sets and mixin. STOC (2003)
Ben Morris
Improved Bounds for Sampling Contingency Tables. RANDOM-APPROX (1999)
Ben Morris, Alistair Sinclair
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. FOCS (1999)