We stand with Ukraine  

Ben Morris

Affiliations:
  • University of California Davis, Department Department, CA, USA
  • Indiana University, Bloomington, IN (former)
  • University of California Berkeley, Statistics Department, CA, USA (former)


According to our database1, Ben Morris authored at least 12 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Format Preserving Encryption in the Bounded Retrieval Model.
[BibTeX]
[DOI]
Ben Morris
,
Hans Oberschelp
,
Hamilton Samraj Santhakumar
CoRR, 2023

2022
A Probabilistic Proof of the nCPA to CCA Bound.
[BibTeX]
[DOI]
Ben Morris
,
Hans Oberschelp
CoRR, 2022

2018
Deterministic Encryption with the Thorp Shuffle.
[BibTeX]
[DOI]
Ben Morris
,
Phillip Rogaway
,
Till Stegers
J. Cryptol., 2018

How Many Queries are Needed to Distinguish a Truncated Random Permutation from a Random Function?
[BibTeX]
[DOI]
Shoni Gilboa
,
Shay Gueron
,
Ben Morris
J. Cryptol., 2018

2014
Sometimes-Recurse Shuffle - Almost-Random Permutations in Logarithmic Expected Time.
[BibTeX]
[DOI]
Ben Morris
,
Phillip Rogaway
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Improved Mixing Time Bounds for the Thorp Shuffle.
[BibTeX]
[DOI]
Ben Morris
Comb. Probab. Comput., 2013

2012
An Enciphering Scheme Based on a Card Shuffle.
[BibTeX]
[DOI]
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.
[BibTeX]
[DOI]
Ben Morris
,
Phillip Rogaway
,
Till Stegers
Proceedings of the Advances in Cryptology, 2009

2005
The mixing time of the Thorp shuffle.
[BibTeX]
[DOI]
Ben Morris
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2003
Evolving sets and mixin.
[BibTeX]
[DOI]
Ben Morris
,
Yuval Peres
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

1999
Improved Bounds for Sampling Contingency Tables.
[BibTeX]
[DOI]
Ben Morris
Proceedings of the Randomization, 1999

Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions.
[BibTeX]
[DOI]
Ben Morris
,
Alistair Sinclair
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999


  Loading...