Advertisement

Interactive Aggregate Message Authentication Scheme with Detecting Functionality

  • Shingo SatoEmail author
  • Junji Shikata
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 926)

Abstract

In this paper, we newly propose a formal model and a construction methodology of interactive aggregate MAC schemes with detecting functionality (IAMD). The IAMD is an interactive aggregate MAC protocol which can identify invalid messages with a small amount of tag-size. Several aggregate MAC schemes that can specify invalid messages have been proposed so far by using non-adaptive group testing in the prior work. Instead, we utilize adaptive group testing to construct IAMD scheme and the resulting IAMD scheme can identify invalid messages with a small amount of tag-size compared to the previous schemes. In this paper, we propose a generic construction of IAMD starting from any adaptive group testing protocol and any aggregate MAC scheme, and we apply several concrete constructions of adaptive group testing protocols and aggregate MAC schemes. In addition, we compare and analyze those IAMD constructions in terms of efficiency and security.

Notes

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.

References

  1. 1.
    Dorfman, R.: The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436–440 (1943)CrossRefGoogle Scholar
  2. 2.
    Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, vol. 12, 2nd edn. World Scientific, Singapore (2000)zbMATHGoogle Scholar
  3. 3.
    Eppstein, D., Goodrich, M.T., Hirschberg, D.S.: Improved combinatorial group testing algorithms for real-world problem sizes. SIAM J. Comput. 36(5), 1360–1375 (2007)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Goodrich, M.T., Atallah, M.J., Tamassia, R.: Indexing information for data forensics. In: Third International Conference on Applied Cryptography and Network Security, ACNS 2005, Lecture Notes in Computer Science, vol. 3531, pp. 206–221. Springer (2005)Google Scholar
  5. 5.
    Hirose, S., Shikata, J.: Non-adaptive group-testing aggregate MAC scheme. In: 14th International Conference on Information Security Practice and Experience (ISPEC 2018), Lecture Notes in Computer Science, vol. 11125, pp. 357–372. Springer (2018)Google Scholar
  6. 6.
    Hwang, F.K.: A method for detecting all defective members in a population by group testing. J. Am. Stat. Assoc. 67(339), 605–608 (1972)CrossRefGoogle Scholar
  7. 7.
    Katz, J., Lindell, A.Y.: Aggregate message authentication codes. In: CT-RSA, Lecture Notes in Computer Science, vol. 4964, pp. 155–169. Springer (2008)Google Scholar
  8. 8.
    Li, C.H.: A sequential method for screening experimental variables. J. Am. Stat. Assoc. 57(298), 455–477 (1962)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Minematsu, K.: Efficient message authentication codes with combinatorial group testing. In: ESORICS, Part 1, Lecture Notes in Computer Science, vol. 9326, pp. 185–202. Springer (2015)Google Scholar
  10. 10.
    Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: ICALP, part 1, Lecture Notes in Computer Science, vol. 5125, pp. 748–759. Springer (2008)Google Scholar
  11. 11.
    Thierry-Mieg, N.: A new pooling strategy for high-throughput screening: the shifted transversal design. BMC Bioinform. 7, 28 (2006)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Graduate School of Environment and Information SciencesYokohama National UniversityYokohamaJapan
  2. 2.Graduate School of Environment and Information Sciences, Institute of Advanced SciencesYokohama National UniversityYokohamaJapan

Personalised recommendations