A Single-Key Variant of LightMAC_Plus
Abstract
:1. Introduction
Our Contributions
2. Preliminaries
2.1. Notations
2.2. Security Definitions
2.3. H-Coefficient Technique
- •
- For , it holds that
- •
- For a view , it holds that
3. 1k-LightMAC_Plus
3.1. Specification
Algorithm 1 1k-LightMAC_Plus. |
|
Algorithm 2 InternalHash. |
|
3.2. Security Bound
4. Proof of Theorem 1
4.1. Initialization
4.1.1. Ideal Oracle
4.1.2. Views
4.2. Analysis of Bad Events
Both and are non-fresh
is fresh and is non-fresh
is non-fresh and is fresh
Both and are fresh.
4.3. Analysis of Good Transcripts
Funding
Institutional Review Board Statement
Informed Consent Statement
Conflicts of Interest
References
- Bellare, M.; Kilian, J.; Rogaway, P. The Security of the Cipher Block Chaining Message Authentication Code. J. Comput. Syst. Sci. 2000, 61, 362–399. [Google Scholar] [CrossRef] [Green Version]
- Black, J.; Rogaway, P. A Block-Cipher Mode of Operation for Parallelizable Message Authentication. In Advances in Cryptology—EUROCRYPT 2002, Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques, Amsterdam, The Netherlands, 28 April–2 May 2002, Proceedings; Knudsen, L.R., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2002; Volume 2332, pp. 384–397. [Google Scholar] [CrossRef] [Green Version]
- Iwata, T.; Kurosawa, K. OMAC: One-Key CBC MA. In Fast Software Encryption, 10th International Workshop, FSE 2003, Lund, Sweden, 24–26 February 2003, Revised Papers; Johansson, T., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2003; Volume 2887, pp. 129–153. [Google Scholar] [CrossRef]
- Luykx, A.; Preneel, B.; Tischhauser, E.; Yasuda, K. A MAC Mode for Lightweight Block Ciphers. In Fast Software Encryption—23rd International Conference, FSE 2016, Bochum, Germany, 20–23 March 2016, Revised Selected Papers; Peyrin, T., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2016; Volume 9783, pp. 43–59. [Google Scholar] [CrossRef] [Green Version]
- Bogdanov, A.; Knudsen, L.R.; Leander, G.; Paar, C.; Poschmann, A.; Robshaw, M.J.B.; Seurin, Y.; Vikkelsoe, C. PRESENT: An Ultra-Lightweight Block Cipher. In Cryptographic Hardware and Embedded Systems—CHES 2007, 9th International Workshop, Vienna, Austria, 10–13 September 2007, Proceedings; Paillier, P., Verbauwhede, I., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2007; Volume 4727, pp. 450–466. [Google Scholar] [CrossRef] [Green Version]
- Guo, J.; Peyrin, T.; Poschmann, A.; Robshaw, M.J.B. The LED Block Cipher. In Cryptographic Hardware and Embedded Systems—CHES 2011—13th International Workshop, Nara, Japan, 28 September–1 October 2011, Proceedings; Preneel, B., Takagi, T., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2011; Volume 6917, pp. 326–341. [Google Scholar] [CrossRef] [Green Version]
- Banik, S.; Pandey, S.K.; Peyrin, T.; Sasaki, Y.; Sim, S.M.; Todo, Y. GIFT: A Small Present—Towards Reaching the Limit of Lightweight Encryption. In Cryptographic Hardware and Embedded Systems—CHES 2017—19th International Conference, Taipei, Taiwan, 25–28 September 2017, Proceedings; Fischer, W., Homma, N., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2017; Volume 10529, pp. 321–345. [Google Scholar] [CrossRef]
- Yasuda, K. The Sum of CBC MACs Is a Secure PRF. In Topics in Cryptology—CT-RSA 2010, The Cryptographers’ Track at the RSA Conference 2010, San Francisco, CA, USA, 1–5 March 2010, Proceedings; Pieprzyk, J., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2010; Volume 5985, pp. 366–381. [Google Scholar] [CrossRef]
- Yasuda, K. A New Variant of PMAC: Beyond the Birthday Bound. In Advances in Cryptology—CRYPTO 2011—31st Annual Cryptology Conference, Santa Barbara, CA, USA, 14–18 August 2011, Proceedings; Rogaway, P., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2011; Volume 6841, pp. 596–609. [Google Scholar] [CrossRef] [Green Version]
- Zhang, L.; Wu, W.; Sui, H.; Wang, P. 3kf9: Enhancing 3GPP-MAC beyond the Birthday Bound. In Advances in Cryptology—ASIACRYPT 2012—18th International Conference on the Theory and Application of Cryptology and Information Security, Beijing, China, 2–6 December 2012, Proceedings; Wang, X., Sako, K., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2012; Volume 7658, pp. 296–312. [Google Scholar] [CrossRef] [Green Version]
- Bernstein, D.J. How to Stretch Random Functions: The Security of Protected Counter Sums. J. Cryptol. 1999, 12, 185–192. [Google Scholar] [CrossRef]
- Bellare, M.; Guérin, R.; Rogaway, P. XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. In Advances in Cryptology—CRYPTO ’95, 15th Annual International Cryptology Conference, Santa Barbara, CA, USA, 27–31 August 1995, Proceedings; Coppersmith, D., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 1995; Volume 963, pp. 15–28. [Google Scholar] [CrossRef] [Green Version]
- Naito, Y. Blockcipher-Based MACs: Beyond the Birthday Bound Without Message Length. In Advances in Cryptology—ASIACRYPT 2017—23rd International Conference on the Theory and Applications of Cryptology and Information Security, Hong Kong, China, 3–7 December 2017, Proceedings, Part III; Takagi, T., Peyrin, T., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2017; Volume 10626, pp. 446–470. [Google Scholar] [CrossRef]
- Datta, N.; Dutta, A.; Nandi, M.; Paul, G. Double-block Hash-then-Sum: A Paradigm for Constructing BBB Secure PRF. IACR Trans. Symmetric Cryptol. 2018, 2018, 36–92. [Google Scholar] [CrossRef]
- Leurent, G.; Nandi, M.; Sibleyras, F. Generic Attacks Against Beyond-Birthday-Bound MACs. In Advances in Cryptology—CRYPTO 2018—38th Annual International Cryptology Conference, Santa Barbara, CA, USA, 19–23 August 2018, Proceedings, Part I; Shacham, H., Boldyreva, A., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2018; Volume 10991, pp. 306–336. [Google Scholar] [CrossRef] [Green Version]
- Kim, S.; Lee, B.; Lee, J. Tight Security Bounds for Double-Block Hash-then-Sum MACs. In Advances in Cryptology—EUROCRYPT 2020—39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Zagreb, Croatia, 10–14 May 2020, Proceedings, Part I; Canteaut, A., Ishai, Y., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2020; Volume 12105, pp. 435–465. [Google Scholar] [CrossRef]
- Naito, Y. Improved Security Bound of LightMAC_Plus and Its Single-Key Variant. In Topics in Cryptology—CT-RSA 2018—The Cryptographers’ Track at the RSA Conference 2018, San Francisco, CA, USA, 16–20 April 2018, Proceedings; Smart, N.P., Ed.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2018; Volume 10808, pp. 300–318. [Google Scholar] [CrossRef]
- Patarin, J. The “Coefficients H” Technique. In Selected Areas in Cryptography, 15th International Workshop, SAC 2008, Sackville, NB, Canada, 14–15 August Revised Selected Papers; Avanzi, R.M., Keliher, L., Sica, F., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2008; Volume 5381, pp. 328–345. [Google Scholar] [CrossRef] [Green Version]
- Chen, S.; Steinberger, J.P. Tight Security Bounds for Key-Alternating Ciphers. In Advances in Cryptology—EUROCRYPT 2014—33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, 11–15 May 2014, Proceedings; Nguyen, P.Q., Oswald, E., Eds.; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 2014; Volume 8441, pp. 327–350. [Google Scholar] [CrossRef] [Green Version]
- Datta, N.; Dutta, A.; Nandi, M.; Paul, G.; Zhang, L. Single Key Variant of PMAC_Plus. IACR Trans. Symmetric Cryptol. 2017, 2017, 268–305. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Song, H. A Single-Key Variant of LightMAC_Plus. Symmetry 2021, 13, 1818. https://doi.org/10.3390/sym13101818
Song H. A Single-Key Variant of LightMAC_Plus. Symmetry. 2021; 13(10):1818. https://doi.org/10.3390/sym13101818
Chicago/Turabian StyleSong, Haitao. 2021. "A Single-Key Variant of LightMAC_Plus" Symmetry 13, no. 10: 1818. https://doi.org/10.3390/sym13101818
APA StyleSong, H. (2021). A Single-Key Variant of LightMAC_Plus. Symmetry, 13(10), 1818. https://doi.org/10.3390/sym13101818