Name
Abstract | ||
|---|---|---|
We describe a security-preserving construction of a random permutation of domain size N from a random function, the construction tolerating adversaries asking all N plaintexts, yet employing just Theta(lg N) calls, on average, to the one-bit-output random function. The approach is based on card shuffling. The basic idea is to use the sometimes-recurse transformation: lightly shuffle the deck (with some other shuffle), cut the deck, and then recursively shuffle one of the two halves. Our work builds on a recent paper of Ristenpart and Yilek. |
Year | Venue | Keywords |
|---|---|---|
2014 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2014 | Card shuffling,format-preserving encryption,PRF-to-PRP conversion,mix-and-cut shuffle,pseudorandom permutations,sometimes-recurse shuffle,swap-or-not shuffle |
DocType | Volume | ISSN |
Conference | 8441 | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ben Morris | 1 | 127 | 8.78 |
| Phillip Rogaway | 2 | 10591 | 920.07 |