Ben Morris - RankMe

17 papers A* 6Journal 10Unranked 1

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