Skip to content

Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Standard

Multi-key Authenticated Encryption with Corruptions : Reductions Are Lossy. / Jager, Tibor; Stam, Martijn; Stanley-Oakes, Ryan; Warinschi, Bogdan.

Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Springer, 2017. p. 409-441 (Lecture Notes in Computer Science; Vol. 10677).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harvard

Jager, T, Stam, M, Stanley-Oakes, R & Warinschi, B 2017, Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. in Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Lecture Notes in Computer Science, vol. 10677, Springer, pp. 409-441. https://doi.org/10.1007/978-3-319-70500-2_14

APA

Jager, T., Stam, M., Stanley-Oakes, R., & Warinschi, B. (2017). Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. In Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I (pp. 409-441). (Lecture Notes in Computer Science; Vol. 10677). Springer. https://doi.org/10.1007/978-3-319-70500-2_14

Vancouver

Jager T, Stam M, Stanley-Oakes R, Warinschi B. Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy. In Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Springer. 2017. p. 409-441. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-319-70500-2_14

Author

Jager, Tibor ; Stam, Martijn ; Stanley-Oakes, Ryan ; Warinschi, Bogdan. / Multi-key Authenticated Encryption with Corruptions : Reductions Are Lossy. Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part I. Springer, 2017. pp. 409-441 (Lecture Notes in Computer Science).

Bibtex

@inproceedings{1a8d33ef8a914e569d961f50bd9a2e10,
title = "Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy",
abstract = "We study the security of symmetric encryption schemes in settings with multiple users and realistic adversaries who can adaptively corrupt encryption keys. To avoid confinement to any particular definitional paradigm, we propose a general framework for multi-key security definitions. By appropriate settings of the parameters of the framework, we obtain multi-key variants of many of the existing single-key security notions.This framework is instrumental in establishing our main results. We show that for all single-key secure encryption schemes satisfying a minimal key uniqueness assumption and almost any instantiation of our general multi-key security notion, any reasonable reduction from the multi-key game to a standard single-key game necessarily incurs a linear loss in the number of keys. We prove this result for all three classical single-key security notions capturing confidentiality, authenticity and the combined authenticated encryption notion.",
keywords = "Secret-key cryptography/authenticated encryption, Multi-user security, Multi-key security, Black-box reductions",
author = "Tibor Jager and Martijn Stam and Ryan Stanley-Oakes and Bogdan Warinschi",
year = "2017",
month = "11",
day = "5",
doi = "10.1007/978-3-319-70500-2_14",
language = "English",
isbn = "9783319704999",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "409--441",
booktitle = "Theory of Cryptography",

}

RIS - suitable for import to EndNote

TY - GEN

T1 - Multi-key Authenticated Encryption with Corruptions

T2 - Reductions Are Lossy

AU - Jager, Tibor

AU - Stam, Martijn

AU - Stanley-Oakes, Ryan

AU - Warinschi, Bogdan

PY - 2017/11/5

Y1 - 2017/11/5

N2 - We study the security of symmetric encryption schemes in settings with multiple users and realistic adversaries who can adaptively corrupt encryption keys. To avoid confinement to any particular definitional paradigm, we propose a general framework for multi-key security definitions. By appropriate settings of the parameters of the framework, we obtain multi-key variants of many of the existing single-key security notions.This framework is instrumental in establishing our main results. We show that for all single-key secure encryption schemes satisfying a minimal key uniqueness assumption and almost any instantiation of our general multi-key security notion, any reasonable reduction from the multi-key game to a standard single-key game necessarily incurs a linear loss in the number of keys. We prove this result for all three classical single-key security notions capturing confidentiality, authenticity and the combined authenticated encryption notion.

AB - We study the security of symmetric encryption schemes in settings with multiple users and realistic adversaries who can adaptively corrupt encryption keys. To avoid confinement to any particular definitional paradigm, we propose a general framework for multi-key security definitions. By appropriate settings of the parameters of the framework, we obtain multi-key variants of many of the existing single-key security notions.This framework is instrumental in establishing our main results. We show that for all single-key secure encryption schemes satisfying a minimal key uniqueness assumption and almost any instantiation of our general multi-key security notion, any reasonable reduction from the multi-key game to a standard single-key game necessarily incurs a linear loss in the number of keys. We prove this result for all three classical single-key security notions capturing confidentiality, authenticity and the combined authenticated encryption notion.

KW - Secret-key cryptography/authenticated encryption

KW - Multi-user security

KW - Multi-key security

KW - Black-box reductions

U2 - 10.1007/978-3-319-70500-2_14

DO - 10.1007/978-3-319-70500-2_14

M3 - Conference contribution

SN - 9783319704999

T3 - Lecture Notes in Computer Science

SP - 409

EP - 441

BT - Theory of Cryptography

PB - Springer

ER -