Multi-key Authenticated Encryption with Corruptions: Reductions Are Lossy [chapter]

Tibor Jager, Martijn Stam, Ryan Stanley-Oakes, Bogdan Warinschi
2017 Lecture Notes in Computer Science  
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
more » ... 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.
doi:10.1007/978-3-319-70500-2_14 fatcat:afehqm23tzhqff3bfqemgifzoy