Anonymous Authentication Based On Secure Multi-party Computation

In recent years, with the rapid development of wireless communications technology and smart phone technology, the number of users who work with their mobile devices grows. As the smart phone becomes a daily necessity, mobile services are springing up, almost throughout every aspect of social life, such as e-commerce, multimedia, online taxi, mobile payments and so on. These services not only bring convenience to people’s lives, but also take more information security threats and challenges. Compared to traditional wired networks, the openness of wireless networks makes attacks more convenient, such as monitoring, interception and tampering. It is a huge threat to network security and personal privacy. The requirements of users’privacy protection are becoming increasingly urgent. Access authentication is the foundation of the security system, users must authenticate their legal identity when they enjoy these online services, and it’s essential to start from the access authentication to protect the privacy of users effectively. The traditional access authentication is generally based on identity, so users need to submit the information of their identity to verify when they authenticate. However, this approach treats the users’anonymity directly. So how to protect the privacy of users is a very important issue while they authenticate their legitimate identity.By the surveys and studies on the theory of current anonymous authentication technology, we find that most methods which achieve anonymous authentication are concentrated in the modern encryption technology and zero-knowledge proof technology. Several mainstream signature technologies, such as blind signature, group signature and ring signature, have the feature of Anonymity. Mainstream signature technologies are suitable for designing anonymous authentication scheme, while they are based on public key cryptography, and at the same time their computational complexity and storage overhead are higher. Considering the limit of bandwidth and resource in wireless networks, we study on anonymous authentication from another filed of information security-secure multiparty computation, and further we design a secure two-party protocol of matrix vector multiplication combining the theory of linear equations. Then based on this protocol we propose a secure and efficient anonymous authentication scheme. Comparing with the existing anonymous authentication schemes based on the traditional cryptographic techniques, the scheme in this paper has great advantages in traffic aspects, computational complexity and storage overhead. Thus, it is especially suitable for some resource-constrained networks, such as wireless sensor networks, vehicle networks, mobile roaming networks, and smart card network.Particularly, considering the condition of joint certification of k users based on the above anonymous authentication protocol, the cost of computing and communications is much high. After taking the special limit of bandwidth and resources in wireless networks into consideration, we propose an efficient anonymous batch authentication scheme based on secure multiparty computation by combining the secure multiparty summation method with the matrix-vector multiplication protocol proposed previously. Especially for resource-constrained wireless networks, when the users get through authentication server cooperatively after authenticating each other’s legal identity. It meets the needs of some special occasions, such as online electronic vote. Theoretical analysis proves that the scheme is unconditionally anonymous, and it takes lower communication, computation and storage overhead compared with other schemes that achieve the same condition of anonymity.