Skip to main content
SpringerLink
Log in

History-Free Sequential Aggregate MAC Revisited

  • Conference paper
  • First Online:
Provable Security (ProvSec 2019)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 11821))

Included in the following conference series:

  • 675 Accesses

Abstract

Eikemeier et al. introduced and formalized sequential aggregate MAC in 2010. They also constructed a history-free scheme for sequential aggregate MAC using a pseudorandom permutation and a MAC function. In this paper, we reconsider history-free sequential aggregate MAC. We give a definition of its security requirement, which is more general than that of Eikemeier et al. Then, we propose two new schemes for history-free sequential aggregate MAC. The first scheme is constructed with a pseudorandom permutation and a pseudorandom function. The second scheme is constructed only with a pseudorandom function under two keying strategies and without a pseudorandom permutation. We reduce the security of the proposed schemes to the security properties of their underlying primitives. We also discuss an instantiation of the second scheme using a pseudorandom function based on a cryptographic hash function such as HMAC with SHA-2 in some detail.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Though the tag for the first message is computed without an aggregate-so-far tag in the formalization of Eikemeier et al., this change is minor.

References

  1. Bellare, M.: New proofs for NMAC and HMAC: security without collision-resistance. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 602–619. Springer, Heidelberg (2006). https://doi.org/10.1007/11818175_36

    Chapter  Google Scholar 

  2. Bellare, M., Bernstein, D.J., Tessaro, S.: Hash-function based PRFs: AMAC and its multi-user security. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 566–595. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49890-3_22

    Chapter  Google Scholar 

  3. Bellare, M., Canetti, R., Krawczyk, H.: Pseudorandom functions revisited: the cascade construction and its concrete security. In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pp. 514–523 (1996)

    Google Scholar 

  4. Bellare, M., Kilian, J., Rogaway, P.: The security of cipher block chaining. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 341–358. Springer, Heidelberg (1994). https://doi.org/10.1007/3-540-48658-5_32

    Chapter  Google Scholar 

  5. Bellare, M., Kohno, T.: A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 491–506. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-39200-9_31

    Chapter  Google Scholar 

  6. Bellare, M., Rogaway, P.: On the construction of variable-input-length ciphers. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 231–244. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48519-8_17

    Chapter  Google Scholar 

  7. Biham, E. (ed.): EUROCRYPT 2003. LNCS, vol. 2656. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-39200-9

    Book  MATH  Google Scholar 

  8. Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and verifiably encrypted signatures from bilinear maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 416–432. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-39200-9_26

    Chapter  Google Scholar 

  9. Chen, Y., Lei, C.: Aggregate message authentication codes (AMACs) with on-the-fly verification. Int. J. Inf. Sec. 12(6), 495–504 (2013). https://doi.org/10.1007/s10207-013-0202-0

    Article  Google Scholar 

  10. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, 2nd edn, vol. 12, World Scientific, Singapore (2000)

    Google Scholar 

  11. Eikemeier, O., et al.: History-free aggregate message authentication codes. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 309–328. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15317-4_20

    Chapter  Google Scholar 

  12. FIPS PUB 180–4: Secure hash standard (SHS), August 2015

    Google Scholar 

  13. FIPS PUB 197: Advanced encryption standard (AES) (2001)

    Google Scholar 

  14. Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792–807 (1986)

    Article  MathSciNet  Google Scholar 

  15. Hirose, S., Kuwakado, H.: Forward-secure sequential aggregate message authentication revisited. In: Chow, S.S.M., Liu, J.K., Hui, L.C.K., Yiu, S.M. (eds.) ProvSec 2014. LNCS, vol. 8782, pp. 87–102. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-12475-9_7

    Chapter  Google Scholar 

  16. Hirose, S., Shikata, J.: Non-adaptive group-testing aggregate MAC scheme. In: Su, C., Kikuchi, H. (eds.) ISPEC 2018. LNCS, vol. 11125, pp. 357–372. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-99807-7_22

    Chapter  Google Scholar 

  17. Katz, J., Lindell, A.Y.: Aggregate message authentication codes. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol. 4964, pp. 155–169. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-79263-5_10

    Chapter  Google Scholar 

  18. Ma, D., Tsudik, G.: Extended abstract: forward-secure sequential aggregate authentication. In: IEEE Symposium on Security and Privacy, pp. 86–91. IEEE Computer Society (2007). Also published as IACR Cryptology ePrint Archive: Report 2007/052

    Google Scholar 

  19. Ma, D., Tsudik, G.: A new approach to secure logging. ACM Trans. Storage 5(1), 2:1–2:21 (2009)

    Article  Google Scholar 

  20. Sato, S., Hirose, S., Shikata, J.: Generic construction of sequential aggregate MACs from any MACs. In: Baek, J., Susilo, W., Kim, J. (eds.) ProvSec 2018. LNCS, vol. 11192, pp. 295–312. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-01446-9_17

    Chapter  Google Scholar 

  21. Yasuda, K.: HMAC without the “Second” Key. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 443–458. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-04474-8_35

    Chapter  Google Scholar 

Download references

Acknowledgements

This research was conducted under a contract of Research and Development for Expansion of Radio Wave Resources funded by the Ministry of Internal Affairs and Communications, Japan.

Author information

Authors and Affiliations

  1. Faculty of Engineering, University of Fukui, Fukui, Japan

    Shoichi Hirose

  2. Japan Datacom Co., Ltd., Tokyo, Japan

    Shoichi Hirose

  3. Graduate School of Environment and Information Sciences, Yokohama National University, Yokohama, Japan

    Junji Shikata

Authors
  1. Shoichi Hirose
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Junji Shikata
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shoichi Hirose .

Editor information

Editors and Affiliations

  1. Monash University, Melbourne, VIC, Australia

    Ron Steinfeld

  2. The University of Hong Kong, Pok Fu Lam, Hong Kong

    Tsz Hon Yuen

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hirose, S., Shikata, J. (2019). History-Free Sequential Aggregate MAC Revisited. In: Steinfeld, R., Yuen, T. (eds) Provable Security. ProvSec 2019. Lecture Notes in Computer Science(), vol 11821. Springer, Cham. https://doi.org/10.1007/978-3-030-31919-9_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-31919-9_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-31918-2

  • Online ISBN: 978-3-030-31919-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation