How to Encipher Messages on a Small Domain

By Ben Morris, Phillip Rogaway, Till Stegers. 2009

111 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Electrical and Electronic Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Electrical and Electronic Engineering

Citations in the corpus

Private Stateful Information Retrieval (2018, background): “The second problem with PRP is that instantiating them securely is quite expensive: in practice one would use PRP based on block ciphers on small domains that can be constructed from secure block ciphers at the cost of multiple evaluations (see, for example, [41, 47]).”
Privacy and Data Protection by Design - from policy to engineering (2014, methodology): “Although the security of FPE was first formalized in [31], FPE constructions and algorithms were preexisting, like [34,147].”
On Generalized Feistel Networks (2010, background): “Interpreting our result, if one holds fixed the block length ℓ=m+n, bounds improve with increasing imbalance, the best bounds at m=1, the setting earlier studied by Morris, Rogaway, and Stegers (“MRS”) [17].”
Pseudorandom Functions: Three Decades Later (2017, background): “,Fr] are not (∞,r2k/2, (1)2)-indistinguishable [103].”
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries (2013, background): “Morris, Rogaway, and Stegers [19] uncover a connection between unbalanced Feistel networks and the Thorp shuﬄe, and use it to prove that maximally unbalanced Feistel networks achieve security up to about q ≈ 2 n (1 − (cid:2) ) queries for a fraction (cid:2) inversely proportional to the the number…”
Can We Access a Database Both Locally and Privately? (2017, methodology): “We use a secret (pseudo-random) permutation over F m to order the codeword symbols (e.g., [MRS09]).”