Abstract
In this paper, we construct an authentication scheme for multi-receivers and multiple messages based on a linear code C. This construction can be regarded as a generalization of the authentication scheme given by Safavi-Naini and Wang [1]. Actually, we notice that the scheme of Safavi-Naini and Wang is constructed with Reed-Solomon codes. The generalization to linear codes has the similar advantages as generalizing Shamir’s secret sharing scheme to linear secret sharing sceme based on linear codes [2–6]. For a fixed message base field \({\mathbb F}_q\), our scheme allows arbitrarily many receivers to check the integrity of their own messages, while the scheme of Safavi-Naini and Wang has a constraint on the number of verifying receivers \(V\leqslant q\). We further introduce access structure in our scheme. Massey [4] characterized the access structure of linear secret sharing scheme by minimal codewords in the dual code whose first component is 1. We slightly modify the definition of minimal codewords in [4]. Let C be a [V,k] linear code. For any coordinate i ∈ {1,2, ⋯ ,V}, a codeword c in C is called minimal respect to i if the codeword c has component 1 at the i-th coordinate and there is no other codeword whose i-th component is 1 with support strictly contained in that of c. Then the security of receiver R i in our authentication scheme is characterized by the minimal codewords respect to i in the dual code \(C^\bot\). Finally, we illustrate our authentication scheme based on the elliptic curve codes, a special class of algebraic geometry codes. We use the group of rational points on the elliptic curve to determine all the malicious groups that can successfully make a substitution attack to any fixed receiver.
This paper is supported by the National Key Basic Research Program of China (973 Program Grant No. 2013CB834204), and the National Natural Science Foundation of China (No. 61171082).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Safavi-Naini, R., Wang, H.: New results on multi-receiver authentication codes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 527–541. Springer, Heidelberg (1998)
Shamir, A.: How to share a secret. Commun. ACM 22, 612–613 (1979)
McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24, 583–584 (1981)
Massey, J.L.: Minimal codewords and secret sharing. In: Proceedings of the 6th Joint Swedish-Russian International Workshop on Information Theory, pp. 276–279 (1993)
Massey, J.L.: Some applications of coding theory in cryptography. In: Codes and Ciphers: Cryptography and Coding IV, pp. 33–47 (1995)
Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computation over small fields. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 521–536. Springer, Heidelberg (2006)
Van Dijk, M., Gehrmann, C., Smeets, B.: Unconditionally secure group authentication. Designs, Codes and Cryptography 14, 281–296 (1998)
Boyd, C.: Digital multisignatures. In: Beker, H., Piper, F. (eds.) Cryptography and Coding, pp. 241–246. Clarendon Press (1986)
Desmedt, Y.G., Frankel, Y.: Shared generation of authenticators and signatures. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 457–469. Springer, Heidelberg (1992)
Desmedt, Y., Frankel, Y., Yung, M.: Multi-receiver/multi-sender network security: efficient authenticated multicast/feedback. In: IEEE INFOCOM 1992, Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, pp. 2045–2054 (1992)
Stichtenoth, H.: Recent Advances in Nonlinear Dynamics and Synchronization, 2nd edn. Graduate Texts in Mathematics, vol. 254. Springer, Berlin (2009)
Chen, H., Ling, S., Xing, C.: Access structures of elliptic secret sharing schemes. IEEE Transactions on Information Theory 54, 850–852 (2008)
Silverman, J.H.: The arithmetic of elliptic curves, 2nd edn. Graduate Texts in Mathematics, vol. 106. Springer, Dordrecht (2009)
Cheng, Q.: Hard problems of algebraic geometry codes. IEEE Transactions on Information Theory 54, 402–406 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Zhang, J., Li, X., Fu, FW. (2014). Multi-receiver Authentication Scheme for Multiple Messages Based on Linear Codes. In: Huang, X., Zhou, J. (eds) Information Security Practice and Experience. ISPEC 2014. Lecture Notes in Computer Science, vol 8434. Springer, Cham. https://doi.org/10.1007/978-3-319-06320-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-06320-1_22
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06319-5
Online ISBN: 978-3-319-06320-1
eBook Packages: Computer ScienceComputer Science (R0)