Revisiting MAC Forgeries, Weak Keys and Provable Security of Galois/Counter Mode of Operation (Englisch)

in Lecture Notes in Computer Science ; 8257 ; 20-38
CANS, International Conference on Cryptology and Network Security, 12

Galois/Counter Mode (GCM) is a block cipher mode of operation widely adopted in many practical applications and standards, such as IEEE 802.1AE and IPsec. We demonstrate that to construct successful forgeries of GCM-like polynomial-based MAC schemes, hash collisions are not necessarily required and any polynomials could be used in the attacks, which removes the restrictions of attacks previously proposed by Procter and Cid. Based on these new discoveries on forgery attacks, we show that all subsets with no less than two authentication keys are weak key classes, if the final block cipher masking is computed additively. In addition, by utilizing a special structure of GCM, we turn these forgery attacks into birthday attacks, which will significantly increase their success probabilities. Furthermore, we provide a method to fix GCM in order to avoid the security proof flaw discovered by Iwata, Ohashi and Minematsu. By applying the method, the security bounds of GCM can be improved by a factor of around 220. Lastly, we show that these forgery attacks will still succeed if GCM adopts MAC-then-Enc paradigm to protect its MAC scheme as one of the options mentioned in previous papers.

Wie erhalte ich diesen Titel?


Inhaltsverzeichnis Konferenzband

Das Inhaltsverzeichnis des Konferenzbandes wird automatisch erzeugt, daher kann es lückenhaft sein, obwohl alle Artikel in der TIB verfügbar sind.

Differential Attacks on Generalized Feistel Schemes
Nachef, V. / Volte, E. / Patarin, J. | 2013
Revisiting MAC Forgeries, Weak Keys and Provable Security of Galois/Counter Mode of Operation
Zhu, Bo / Tan, Yin / Gong, Guang | 2013
Padding Oracle Attack on PKCS#1 v1.5: Can Non-standard Implementation Act as a Shelter?
Gao, S. / Chen, H. / Fan, L. | 2013
Zero Knowledge Proofs from Ring-LWE
Xie, X. / Xue, R. / Wang, M. | 2013
Zero Knowledge with Rubik's Cubes and Non-abelian Groups
Volte, Emmanuel / Patarin, Jacques / Nachef, Valerie | 2013
Efficient Modular NIZK Arguments from Shift and Product
Fauzi, P. / Lipmaa, H. / Zhang, B. | 2013
Strongly Secure One-Round Group Authenticated Key Exchange in the Standard Model
Li, Yong / Yang, Zheng | 2013
Achieving Correctness in Fair Rational Secret Sharing
De, S.J. / Pal, A.K. | 2013
BotSuer: Suing Stealthy P2P Bots in Network Traffic through Netflow Analysis
Kheir, Nizar / Wolley, Chirine | 2013
Resource Access Control in the Facebook Model
Chronopoulos, Konstantinos / Gouseti, Maria / Kiayias, Aggelos | 2013
Wave-to-Access: Protecting Sensitive Mobile Device Services via a Hand Waving Gesture
Shrestha, Babins / Saxena, Nitesh / Harrison, Justin | 2013
Semantically-Secure Functional Encryption: Possibility Results, Impossibility Results and the Quest for a General Definition
Bellare, M. / O Neill, A. | 2013
Efficient Lossy Trapdoor Functions Based on Subgroup Membership Assumptions
Xue, H. / Li, B. / Lu, X. / Jia, D. / Liu, Y. | 2013
Unique Aggregate Signatures with Applications to Distributed Verifiable Random Functions
Kuchta, V. / Manulis, M. | 2013
A Practical Related-Key Boomerang Attack for the Full MMB Block Cipher
Ashur, T. / Dunkelman, O. | 2013
Truncated Differential Analysis of Reduced-Round LBlock
Emami, S. / McDonald, C. / Pieprzyk, J. / Steinfeld, R. | 2013
How to Update Documents Verifiably in Searchable Symmetric Encryption
Kurosawa, Kaoru / Ohtaki, Yasuhiro | 2013
Private Outsourcing of Polynomial Evaluation and Matrix Multiplication Using Multilinear Maps
Zhang, L.F. / Safavi-Naini, R. | 2013

Ähnliche Titel