Research On Group Authentication Based On Secret Sharing Of Linear Code

Identity authentication is an important technology to protect information security.With the rapid development of computer technology,online conferencing,distributed collaboration and other group-oriented communication model has become an important concept in the network system,and appeared for the group communication authentication technology-group authentication.Unlike the traditional one-to-one authentication mode,the group authentication scheme is a many-to-many authentication which requires a single certification to determine whether all participants belong to the same communication group.As an important research direction of modern application cryptography,(t,n)threshold secret sharing is a powerful tool for building group-oriented security protocols,and is widely used in security multi-party computing,access control and other fields.Its basic idea is:by dividing a secret into n copies,making t and more than t copies can reconstruct the secret,and less than t copies cannot reconstruct the secret.In order to solve the problem of computational complexity and lack of flexibility in the existing group authentication schemes,this paper deeply studies the group-oriented threshold secret sharing system,and gives its linear code implementation.On this basis,we propose two kinds of authentication schemes:(t,m,n)and(t,m,n)-AS group authentication schemes.(T,m,n)group authentication scheme can determine whether all the participants belong to the same group by a single certification.During the registration phase of the scenario,the group manager sends a share to each participant.During the certification phase,each participant uses its share to generate an authentication token to participate in group authentication.The authentication token can bind all the participants into an indivisible group,ensuring that all the participants have a legitimate share.However,in the absence of an illegal participant,the program cannot find a specific illegal participant.(T,m,n)-AS group authentication scheme adds a single authentication function based on the(t,m,n)group authentication scheme,so that the scheme can not only determine whether all participants belong to the same group by a single certification.In the case of unlawful participants,all illegal participants can be identified within O(m)time without additional communication.The two group authentication schemes proposed in this paper improve the efficiency of authentication,and solve the shortcoming of limited threshold selection in the existing group authentication schemes.The two group authentication schemes can resist the conspiring attacks of up to t-1 members,while the scenarios are safe for a non-member adversary with at most m-1 intercepted tokens from passing authentication.The two proposed solutions are independent of any computational assumptions and are unconditionally secure.