Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2018, Article ID 9715947, 12 pages
https://doi.org/10.1155/2018/9715947
Research Article

Close to Optimally Secure Variants of GCM

1Key Laboratory of Electromagnetic Space Information, CAS, University of Science and Technology of China, Hefei 230027, China
2School of Economics and Management, Southeast University, Nanjing 211189, China

Correspondence should be addressed to Ping Zhang; nc.ude.ctsu.liam@pgz

Received 21 August 2017; Revised 5 December 2017; Accepted 16 January 2018; Published 6 March 2018

Academic Editor: Kamal D. Singh

Copyright © 2018 Ping Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Rogaway, “Authenticated-encryption with associated-data,” in Proceedings of the 9th ACM Conference on Computer and Communications Security (CCS '02), pp. 98–107, Washington, Wash, USA, November 2002. View at Publisher · View at Google Scholar · View at Scopus
  2. Y. Sasaki and K. Yasuda, “A new mode of operation for incremental authenticated encryption with associated data,” in Selected areas in cryptography—SAC 2015, vol. 9566 of Lecture Notes in Computer Science, pp. 397–416, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  3. C. S. Jutla, “Encryption modes with almost free message integrity,” in Advances in cryptology—EUROCRYPT 2001 (Innsbruck), vol. 2045 of Lecture Notes in Computer Science, pp. 529–544, Springer, Heidelberg, Germany, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  4. P. Rogaway, “Efficient instantiations of tweakable blockciphers and refinements to modes OCB and PMAC,” in Advances in cryptology—ASIACRYPT 2004, vol. 3329 of Lecture Notes in Computer Science, pp. 16–31, Springer, Heidelberg, Germany, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  5. P. Rogaway, M. Bellare, and R. S. Ferguson, “OCB: a block-cipher mode of operation for efficient authenticated encryption,” ACM Transactions on Information and System Security, vol. 6, no. 3, pp. 365–403, 2003. View at Publisher · View at Google Scholar
  6. E. Andreeva, A. Bogdanov, A. Luykx, B. Mennink, E. Tischhauser, and K. Yasuda, “Parallelizable and authenticated online ciphers,” in Advances in cryptology—ASIACRYPT 2013, vol. 8269 of Lecture Notes in Computer Science, pp. 424–443, Springer, Heidelberg, Germany, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  7. F. Abed, S. Fluhrer, C. Forler et al., “Pipelineable on-line encryption,” in Fast Software Encryption, vol. 8540 of Lecture Notes in Computer Science, pp. 205–223, Springer, Heidelberg, Germany, 2015. View at Publisher · View at Google Scholar · View at Scopus
  8. L. Bossuet, N. Datta, C. Mancillas-Lopez, and M. Nandi, “ELmD: a pipelineable authenticated encryption and its hardware implementation,” IEEE Transactions on Computers, vol. 65, no. 11, pp. 3318–3331, 2016. View at Publisher · View at Google Scholar · View at Scopus
  9. E. Fleischmann, C. Forler, and S. Lucks, “McOE: a family of almost foolproof on-line authenticated encryption schemes,” in Fast Software Encryption, vol. 7549 of Lecture Notes in Computer Science, pp. 196–215, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar · View at Scopus
  10. C. Forler, E. List, S. Lucks, and J. Wenzel, “Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch,” in ACISP 2016: Information Security and Privacy, vol. 9723 of Lecture Notes in Computer Science, pp. 317–332, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar · View at Scopus
  11. E. List and M. Nandi, “Revisiting full-PRF-secure PMAC and using it for beyond-birthday authenticated encryption,” in Topics in cryptology—CT-RSA 2017, vol. 10159 of Lecture Notes in Computer Science, pp. 258–274, Springer, Heidelberg, Germany, 2017. View at Publisher · View at Google Scholar · View at MathSciNet
  12. T. Peyrin and Y. Seurin, “Counter-in-tweak: authenticated encryption modes for tweakable block ciphers,” in Advances in Cryptology–CRYPTO 2016, vol. 9814 of Lecture Notes in Computer Science, pp. 33–63, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  13. M. Liskov, R. L. Rivest, and D. Wagner, “Tweakable block ciphers,” in Advances in Cryptology–CRYPTO 2002, vol. 2442 of Lecture Notes in Computer Science, pp. 31–46, Springer, Heidelberg, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  14. M. Liskov, R. L. Rivest, and D. Wagner, “Tweakable block ciphers,” Journal of Cryptology, vol. 24, no. 3, pp. 588–613, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. T. Iwata and K. Yasuda, “HBS: a single-key mode of operation for deterministic authenticated encryption,” in Fast Software Encryption, vol. 5665 of Lecture Notes in Computer Science, pp. 394–415, Springer, Heidelberg, Germany, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Rogaway and T. Shrimpton, “A provable-security treatment of the key-wrap problem,” in Advances in cryptology—EUROCRYPT 2006, vol. 4004 of Lecture Notes in Computer Science, pp. 373–390, Springer, Heidelberg, Germany, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  17. V. T. Hoang, T. Krovetz, and P. Rogaway, “Robust authenticated-encryption AEZ and the problem that it solves,” in Advances in Cryptology–EUROCRYPT 2015, vol. 9056 of Lecture Notes in Computer Science, pp. 15–44, Springer, Heidelberg, Germany, 2015. View at Publisher · View at Google Scholar · View at Scopus
  18. N. Ferguson, D. Whiting, B. Schneier, J. Kelsey, S. Lucks, and T. Kohno, “Helix: fast encryption and authentication in a single cryptographic primitive,” in Fast Software Encryption, vol. 2887 of Lecture Notes in Computer Science, pp. 330–346, Springer, Heidelberg, Germany, 2003. View at Publisher · View at Google Scholar
  19. H. Wu and B. Preneel, “AEGIS: a fast authenticated encryption algorithm,” in Selected Areas in Cryptography—SAC 2013, vol. 8282 of Lecture Notes in Computer Science, pp. 185–201, Springer, Heidelberg, Germany, 2014. View at Publisher · View at Google Scholar
  20. M. Bellare and C. Namprempre, “Authenticated encryption: relations among notions and analysis of the generic composition paradigm,” in Advances in Cryptology–ASIACRYPT 2000, vol. 1976 of Lecture Notes in Computer Science, pp. 531–545, Springer, Heidelberg, Germany, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  21. M. Bellare, P. Rogaway, and D. Wagner, “The EAX mode of operation,” in FSE 2004: Fast Software Encryption, B. Roy and W. Meier, Eds., vol. 3017 of Lecture Notes in Computer Science, pp. 389–407, Springer, Heidelberg, Germany, 2004. View at Publisher · View at Google Scholar
  22. T. Krovetz, “HS1-SIV,” 2015, https://competitions.cr.yp.to/round2/hs1sivv2c.pdf.
  23. P. Jovanovic, A. Luykx, and B. Mennink, “Beyond security in sponge-based authenticated encryption modes,” in Advances in Cryptology–ASIACRYPT 2014, vol. 8873 of Lecture Notes in Computer Science, pp. 85–104, Springer, Heidelberg, Germany, 2014. View at Google Scholar · View at MathSciNet
  24. C. Dobraunig, M. Eichlseder, F. Mendel, and M. Schlaffer, “Ascon v1.2,” 2016, https://competitions.cr.yp.to/round3/asconv12.pdf.
  25. G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Duplexing the sponge: single-pass authenticated encryption and other applications,” in SAC 2011: Selected Areas in Cryptography, vol. 7118 of Lecture Notes in Computer Science, pp. 320–337, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar · View at Scopus
  26. R. Granger, P. Jovanovic, B. Mennink, and S. Neves, “Improved masking for tweakable blockciphers with applications to authenticated encryption,” in Advances in Cryptology–EUROCRYPT 2016, vol. 9665 of Lecture Notes in Computer Science, pp. 263–293, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  27. S. Cogliani, D. S. Maimuţ, D. Naccache et al., “OMD: a compression function mode of operation for authenticated encryption,” in Selected areas in cryptography—SAC 2014, vol. 8781 of Lecture Notes in Computer Science, pp. 112–128, Springer, Heidelberg, Germany, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  28. R. Reyhanitabar, S. Vaudenay, and D. Vizár, “Boosting OMD for almost free authentication of associated data,” in FSE 2015: Fast Software Encryption, vol. 9054 of Lecture Notes in Computer Science, pp. 411–427, Springer, Heidelberg, Germany, 2015. View at Publisher · View at Google Scholar · View at Scopus
  29. K. Minematsu, “Parallelizable rate-1 authenticated encryption from pseudorandom functions,” in Advances in Cryptology–EUROCRYPT 2014, vol. 8441 of Lecture Notes in Computer Science, pp. 275–292, Springer, Heidelberg, Germany, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  30. T. Iwata, “New blockcipher modes of operation with beyond the birthday bound security,” in Fast Software Encryption, vol. 4047 of Lecture Notes in Computer Science, pp. 310–327, Springer, Heidelberg, Germany, 2006. View at Publisher · View at Google Scholar
  31. T. Iwata, “Authenticated encryption mode for beyond the birthday bound security,” in Advances in Cryptology–AFRICACRYPT 2008, vol. 5023 of Lecture Notes in Computer Science, pp. 125–142, Springer, Heidelberg, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  32. T. Iwata and K. Minematsu, “Stronger security variants of GCM-SIV,” IACR Transactions on Symmetric Cryptology, vol. 2016, no. 1, pp. 134–157, 2016. View at Google Scholar
  33. D. A. McGrew and J. Viega, “The security and performance of the Galois/counter mode (GCM) of operation,” in Progress in cryptology—INDOCRYPT 2004, vol. 3348 of Lecture Notes in Computer Science, pp. 343–355, Springer, Heidelberg, Germany, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  34. T. Iwata, K. Ohashi, and K. Minematsu, “Breaking and repairing GCM security proofs,” in Advances in cryptology—CRYPTO 2012, vol. 7417 of Lecture Notes in Computer Science, pp. 31–49, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  35. Y. Niwa, K. Ohashi, K. Minematsu, and T. Iwata, “GCM security bounds reconsidered,” in Fast Software Encryption, vol. 9054 of Lecture Notes in Computer Science, pp. 385–407, Springer, Heidelberg, Germany, 2015. View at Publisher · View at Google Scholar
  36. M. J. O. Saarinen, “Cycling attacks on GCM, GHASH and other polynomial MACs and hashes,” in Fast Software Encryption, A. Canteaut, Ed., Lecture Notes in Computer Science, pp. 216–225, Springer, Heidelberg, Germany, 2012. View at Publisher · View at Google Scholar
  37. M. A. Abdelraheem, P. Beelen, A. Bogdanov, and E. Tischhauser, “Twisted polynomials and forgery attacks on GCM,” in Advances in Cryptology–EUROCRYPT 2015, vol. 9056 of Lecture Notes in Computer Science, pp. 762–786, Springer, Heidelberg, Germany, 2015. View at Publisher · View at Google Scholar · View at Scopus
  38. M. Bellare and B. Tackmann, “The multi-user security of authenticated encryption: AES-GCM in TLS 1.3,” in Advances in cryptology—CRYPTO 2016, vol. 9814 of Lecture Notes in Computer Science, pp. 247–276, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  39. H. Böck, A. Zauner, S. Devlin, J. Somorovsky, and P. Jovanovic, “Nonce-disrespecting adversaries: practical forgery attacks on GCM in TLS,” 2016, https://eprint.iacr.org/2016/475.pdf.
  40. S. Gueron and Y. Lindell, “GCM-SIV: full nonce misuse-resistant authenticated encryption at under one cycle per byte,” in Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS 2015, pp. 109–119, Denver, Colo, USA, October 2015. View at Publisher · View at Google Scholar · View at Scopus
  41. K. Aoki and K. Yasuda, “The security and performance of ‘GCM’ when short multiplications are used instead,” in Information Security and Cryptology, vol. 7763 of Lecture Notes in Computer Science, pp. 225–245, Springer Berlin Heidelberg, Heidelberg, Germany, 2013. View at Publisher · View at Google Scholar
  42. W.-S. Yap, S. L. Yeo, S.-H. Heng, and M. Henricksen, “Security analysis of GCM for communication,” Security and Communication Networks, vol. 7, no. 5, pp. 854–864, 2014. View at Publisher · View at Google Scholar · View at Scopus
  43. B. Zhu, Y. Tan, and G. Gong, “Revisiting MAC forgeries, weak keys and provable security of Galois/counter mode of operation,” in Cryptology and network security, vol. 8257 of Lecture Notes in Computer Science, pp. 20–38, Springer, Heidelberg, Germany, 2013. View at Publisher · View at Google Scholar · View at MathSciNet
  44. T. Iwata and Y. Seurin, “Reconsidering the security bound of AES-GCM-SIV,” 2017, https://eprint.iacr.org/2017/708.pdf.
  45. B. t. Cogliati and Y. Seurin, “EWCDM: an efficient, beyond-birthday secure, nonce-misuse resistant MAC,” in Advances in cryptology—CRYPTO 2016, vol. 9814 of Lecture Notes in Computer Science, pp. 121–149, Springer, Heidelberg, Germany, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  46. B. Mennink and S. Neves, “Encrypted davies-meyer and its dual: towards optimal security using mirror theory,” in Advances in cryptology—CRYPTO 2017, vol. 10403 of Lecture Notes in Computer Science, pp. 556–583, Springer, Heidelberg, Germany, 2017. View at Publisher · View at Google Scholar · View at MathSciNet
  47. P. Zhang, H. G. Hu, and P. Wang, “Efficient beyond-birthday-bound secure authenticated encryption modes,” Science China Information Sciences, 2017. View at Google Scholar
  48. B. Mennink and S. Neves, “Optimal PRFs from Blockcipher Designs,” IACR Transactions on Symmetric Cryptology, vol. 2017, no. 3, pp. 228–252, 2017. View at Google Scholar