Ben Morris

According to our database, Ben Morris authored at least 13 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Format Preserving Encryption in the Bounded Retrieval Model.

Ben Morris, Hans Oberschelp, Hamilton Samraj Santhakumar

CoRR, 2023

2022

A Probabilistic Proof of the nCPA to CCA Bound.

Ben Morris, Hans Oberschelp

CoRR, 2022

2018

Deterministic Encryption with the Thorp Shuffle.

Ben Morris, Phillip Rogaway, Till Stegers

J. Cryptol., 2018

How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?

Shoni Gilboa, Shay Gueron, Ben Morris

J. Cryptol., 2018

Communicative pressure can lead to input that supports language learning.

Ben Morris, Daniel Yurovsky

Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018

2013

Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time.

Ben Morris, Phillip Rogaway

IACR Cryptol. ePrint Arch., 2013

Improved Mixing Time Bounds for the Thorp Shuffle.

Ben Morris

Comb. Probab. Comput., 2013

2012

An Enciphering Scheme Based on a Card Shuffle.

Viet Tung Hoang, Ben Morris, Phillip Rogaway

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2009

How to Encipher Messages on a Small Domain.

Ben Morris, Phillip Rogaway, Till Stegers

Proceedings of the Advances in Cryptology, 2009

2008

The Mixing Time of the Thorp Shuffle.

Ben Morris

SIAM J. Comput., 2008

2004

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions.

Ben Morris, Alistair Sinclair

SIAM J. Comput., 2004

2003

Evolving sets and mixin.

Ben Morris, Yuval Peres

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002

Improved bounds for sampling contingency tables.

Ben J. Morris

Random Struct. Algorithms, 2002