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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
This type of testing is typically designed by providing a d-disjunct matrix or a d-separable matrix (e.g., see [2] for the survey of non-adaptive group testing).
References
Dorfman, R.: The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436–440 (1943)
Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, vol. 12, 2nd edn. World Scientific, Singapore (2000)
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)
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)
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)
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)
Katz, J., Lindell, A.Y.: Aggregate message authentication codes. In: CT-RSA, Lecture Notes in Computer Science, vol. 4964, pp. 155–169. Springer (2008)
Li, C.H.: A sequential method for screening experimental variables. J. Am. Stat. Assoc. 57(298), 455–477 (1962)
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)
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)
Thierry-Mieg, N.: A new pooling strategy for high-throughput screening: the shifted transversal design. BMC Bioinform. 7, 28 (2006)
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Sato, S., Shikata, J. (2020). Interactive Aggregate Message Authentication Scheme with Detecting Functionality. In: Barolli, L., Takizawa, M., Xhafa, F., Enokido, T. (eds) Advanced Information Networking and Applications. AINA 2019. Advances in Intelligent Systems and Computing, vol 926. Springer, Cham. https://doi.org/10.1007/978-3-030-15032-7_110
Download citation
DOI: https://doi.org/10.1007/978-3-030-15032-7_110
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-15031-0
Online ISBN: 978-3-030-15032-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)