Analyzing multi-key security degradation
The multi-key, or multi-user, setting challenges cryptographic algorithms to maintain high levels of security when used with many different keys, by many different users. Its significance lies in the fact that in the real world, cryptography is rarely used with a single key in isolation. A folklore result, proved by Bellare, Boldyreva, and Micali for public-key encryption in EUROCRYPT 2000, states that the success probability in attacking any one of many independently keyed algorithms can be bounded by the success probability of attacking a single instance of the algorithm, multiplied by the number of keys present. Although sufficient for settings in which not many keys are used, once cryptographic algorithms are used on an internet-wide scale, as is the case with TLS, the effect of multiplying by the number of keys can drastically erode security claims. We establish a sufficient condition on cryptographic schemes and security games under which multi-key degradation is avoided. As illustrative examples, we discuss how AES and GCM behave in the multi-key setting, and prove that GCM, as a mode, does not have multi-key degradation. Our analysis allows limits on the amount of data that can be processed per key by GCM to be significantly increased. This leads directly to improved security for GCM as deployed in TLS on the Internet today.
|AES, GCM, Multi-key, Multi-oracle, Multi-user, TLS, Weak keys|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Luykx, A, Mennink, B.J.M, & Paterson, K.G. (2017). Analyzing multi-key security degradation. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 575–605). doi:10.1007/978-3-319-70697-9_20