Name
Abstract | ||
|---|---|---|
Assume that a symmetric encryption scheme has been deployed and used with a secret key. We later must change the encryption scheme in a way that preserves the ability to decrypt (a subset of) previously encrypted plaintexts. Frequent real-world examples are migrating from a token-based encryption system for credit-card numbers to a format-preserving encryption (FPE) scheme, or extending the message space of an already deployed FPE. The ciphertexts may be stored in systems for which it is not easy or not efficient to retrieve them (to re-encrypt the plaintext under the new scheme). We introduce methods for functionality-preserving modifications to encryption, focusing particularly on deterministic, length-preserving ciphers such as those used to perform format-preserving encryption. We provide a new technique, that we refer to as the Zig-Zag construction, that allows one to combine two ciphers using different domains in a way that results in a secure cipher on one domain. We explore its use in the two settings above, replacing token-based systems and extending message spaces. We develop appropriate security goals and prove security relative to them assuming the underlying ciphers are themselves secure as strong pseudorandom permutations. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/978-3-319-56614-6_17 | ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT II |
DocType | Volume | ISSN |
Conference | 10211 | 0302-9743 |
Citations | PageRank | References |
2 | 0.38 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paul Grubbs | 1 | 172 | 8.70 |
| Thomas Ristenpart | 2 | 3390 | 149.67 |
| Yuval Yarom | 3 | 775 | 35.54 |