Asynchronous Group Authentication Based on Geometric Approach

Individual authentication in air warfare is used to check whether a single participant is a legal member of the predefined group but not determine all participants at one time. An asynchronous (m, t, n) group authentication protocol is proposed based on multidimensional sphere reconstruction theorem of space analytic geometry without making any computational assumption, where m is the number of participants, t is threshold value, and n is the number of members. The proposed protocol can determine whether all participants belong to the predefined group at one time, which is applicable to batch verification prior to individual authentication. The center’s coordinate of - dimensional sphere is treated as the shared secret and the coordinate of the point on the surface of the sphere, multiplied by a random blind factor, is issued to all members as their tokens. If m participants can reconstruct the shared secret by utilizing their tokens, indicate that there is not any invalid participant, otherwise perform individual authentication. Analyses show the proposed scheme can not only rule out the illegal outsider but also resist up to group member conspiring to forge a valid token for an outsider. In addition, compared with other schemes the proposed scheme is more applicable for air warfare network, with light-weight computation, flexible distribution, and high information rate.

[1]  Baoyuan Kang,et al.  A secure Certificateless Aggregate Signature Scheme , 2016 .

[2]  Lein Harn,et al.  Group Authentication , 2013, IEEE Transactions on Computers.

[3]  Jianfeng Ma,et al.  A Secure and Efficient ID-Based Aggregate Signature Scheme for Wireless Sensor Networks , 2017, IEEE Internet of Things Journal.

[4]  Naoto Yanai,et al.  Tightly-Secure Identity-Based Structured Aggregate Signature Scheme under the Computational Diffie-Hellman Assumption , 2016, 2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA).

[5]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[6]  Hovav Shacham,et al.  Aggregate and Verifiably Encrypted Signatures from Bilinear Maps , 2003, EUROCRYPT.

[7]  Li Yan.  A Novel and Provably Secure Certificateless Aggregate Signature Scheme , 2015 .

[8]  Kijoon Chae,et al.  A Group Authentication Scheme Based on Lagrange Interpolation Polynomial , 2016, 2016 10th International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS).

[9]  Craig Gentry,et al.  Identity-Based Aggregate Signatures , 2006, Public Key Cryptography.

[10]  Yu Ya.  Research Progress of U.S.Military Forces' Battlefield Airborne Communication Node , 2014 .

[11]  G. R. BLAKLEY.  Safeguarding cryptographic keys , 1979, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[12]  Shaohua Tang,et al.  Sharing Multi-Secret Based on Circle Properties , 2008, 2008 International Conference on Computational Intelligence and Security.

[13]  Douglas H. Wiedemann.  Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[14]  Fuyou Miao,et al.  Asynchronous Group Authentication , 2017 .