default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBen Morris 0001
Person information
- affiliation: University of California Davis, Department Department, CA, USA
- affiliation (former): Indiana University, Bloomington, IN
- affiliation (former): University of California Berkeley, Statistics Department, CA, USA
Other persons with the same name
- Benjamin Morris 0002 (aka: Benjamin C. Morris, Ben Morris 0002) — University of Chicago, Department of Psychology, IL, USA
- Ben Morris 0003
![[0009-0004-9527-5935]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0009-0004-9527-5935")
— Newcastle University, Newcastle upon Tyne, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i5]Ben Morris, Hans Oberschelp, Hamilton Samraj Santhakumar:
Format Preserving Encryption in the Bounded Retrieval Model. CoRR abs/2307.08158 (2023)- 2022
- [i4]Ben Morris, Hans Oberschelp:
A Probabilistic Proof of the nCPA to CCA Bound. CoRR abs/2211.07896 (2022)
2010 – 2019
- 2018
- [j6]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): 162-171 (2018) - [j5]Ben Morris, Phillip Rogaway, Till Stegers:
Deterministic Encryption with the Thorp Shuffle. J. Cryptol. 31(2): 521-536 (2018) - 2014
- [c7]Ben Morris, Phillip Rogaway:
Sometimes-Recurse Shuffle - Almost-Random Permutations in Logarithmic Expected Time. EUROCRYPT 2014: 311-326 - [i3]Shoni Gilboa, Shay Gueron, Ben Morris:
How many queries are needed to distinguish a truncated random permutation from a random function? CoRR abs/1412.5204 (2014) - 2013
- [j4]Ben Morris:
Improved Mixing Time Bounds for the Thorp Shuffle. Comb. Probab. Comput. 22(1): 118-132 (2013) - [i2]Ben Morris, Phillip Rogaway:
Sometimes-Recurse Shuffle: Almost-Random Permutations in Logarithmic Expected Time. IACR Cryptol. ePrint Arch. 2013: 560 (2013) - 2012
- [c6]Viet Tung Hoang, Ben Morris, Phillip Rogaway:
An Enciphering Scheme Based on a Card Shuffle. CRYPTO 2012: 1-13 - [i1]Viet Tung Hoang, Ben Morris, Phillip Rogaway:
An Enciphering Scheme Based on a Card Shuffle. CoRR abs/1208.1176 (2012)
2000 – 2009
- 2009
- [c5]Ben Morris, Phillip Rogaway, Till Stegers:
How to Encipher Messages on a Small Domain. CRYPTO 2009: 286-302 - 2008
- [j3]Ben Morris:
The Mixing Time of the Thorp Shuffle. SIAM J. Comput. 38(2): 484-504 (2008) - 2005
- [c4]Ben Morris:
The mixing time of the Thorp shuffle. STOC 2005: 403-412 - 2004
- [j2]Ben Morris, Alistair Sinclair:
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. SIAM J. Comput. 34(1): 195-226 (2004) - 2003
- [c3]Ben Morris, Yuval Peres:
Evolving sets and mixin. STOC 2003: 279-286 - 2002
- [j1]Ben J. Morris:
Improved bounds for sampling contingency tables. Random Struct. Algorithms 21(2): 135-146 (2002)
1990 – 1999
- 1999
- [c2]Ben Morris, Alistair Sinclair:
Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions. FOCS 1999: 230-240 - [c1]Ben Morris:
Improved Bounds for Sampling Contingency Tables. RANDOM-APPROX 1999: 121-129
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-12-04 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
