With the rapid development of mobile Internet technology,mobile online applications such as social networking and Internet of Vehicles are increasingly popular.Many users begin to pay attention to privacy protection issues.One-way anonymous authentication protects some of the user’s identity information,but discloses the users’ affiliations.Therefore,scholars have studied various two-way anonymous authentication protocols that can protect the privacy of users’ affiliations.It allows two participants from the same group to identify each other privately and establish a session key on the public network.Later scholars proposed a variety of secret handshake schemes based on one-time pseudonyms and reusable certificates.Different security properties such as traceability,linkability,deniability,revocability,and unlinkability appear in these schemes.However,existing schemes fail to achieve a good balance between efficient revocation,complete security properties,and computational and communication overhead.It is not a small burden to the resource-constrained mobile environment,which limits the application scenarios of the secret handshake protocol.According to the characteristics of the mobile application environment,this thesis deeply studies the two-party anonymous authentication protocol and analyzes the strengths and problems of existing schemes.The main work of this thesis includes:(1)Present a new generic framework for constructing a mutual anonymous authentication protocol from verifier-local revocation group signature(VLR-GS),named VLR-GSH.(2)Derived from this framework,we propose an efficient two-way anonymous authentication protocol with relatively complete security properties,named RSH-BU.(3)Simulation,performance comparison and application analysis of this protocol.The features of this protocol are: Firstly,this scheme implements an efficient revocation mechanism,as well as unlinkability and traceability.Secondly,this thesis further investigates backward unlinkability,which preserves the privacy of the past behavior of revoked members.Thirdly,we also strengthen the communication protection between Group Administrator(GA)and members,such that group members will not be forged by malicious GA.Finally,compared with the previous secret handshake schemes,our scheme greatly reduces the communication and computing overhead,so it is especially suitable for mobile environments.Based on the difficulty of Decision Linear(DLIN)and q-Strong Diffie-Hellman(q-SDH)problems,the scheme is provably secure in the random oracle model. |