A Study Of Protocols On Two Stage Authentication And Multi-receiver Privacy Protection In Unreliable Communication

When verifying the user's connection to the central server in independent authentication,this paper presented two concepts when a server validates an identity.They are Local Proof and Delayed Proof.The former can solve the local authentication,so that the applications of local launch don't need to validate the identity on line;the latter can prevent fraudulent behavior when two nodes generate a session key for data transmission by switching delay.Particularly,you have to wait for the authentication server on line if the data is generated because of the core business,such as contract signing or cash transactions.The two-phase authentication protocol in unreliable communications in this article is intended to improve efficiency.For some non-critical business,anyone can effectively use the time to negotiate or authenticate on the server.Therefore,this paper proposes a solution to unreliable communication by the chaos mapping theory,and named CMFC.The program can temporarily bypass the collapse of the authentication server in order to run a variety of applications.For the core business,this paper adopts the idea of two-phase:(1)When the authentication server is not available,the CMFC can do local authentication or compute a temporary delay certificate and a session key for both parties to exchange.(2)When the authentication server is available,both parties decide whether or not to commit or suspend the transaction based on the authentication idea of phase(1)and authentication server.Finally,the two-phase authentication scheme in unreliable communication in this paper is completely proved by BAN logic and efficiency analysis method.Multi-participant encryption is an important method of encryption.In an insecure network environment,multi-participant encryption enables secure messaging in the form of 1 to n within n +1 users.In this paper,a new multi-participant encryption scheme is proposed by chaos mapping and named as MRCM.The program aims to use a ciphertext exchange process for authentication and privacy messaging.The solution eliminates the PKG in both single-domain and multi-domain.It will result in a highly distributed solution so that minimize the risk of single-point security and increase the single-point efficiency in order to reduce the failure of one pin probe on the PKG.In addition,this scheme is an efficient cryptographic system based on chaotic mapping which is used to construct multi-participant public key cryptosystem.And it differs from the bilinear pairings.Bilinear pairing cryptography requires many redundancy algorithms to obtain anonymous privacy,and our scheme makes it easy to obtain privacy without these actions.The scheme uses mutual chaos mapping for mutual authentication and privacy protection,avoids the mutual transmission of the encryption or decryption messages between the sender and the receiver,enhances the security and effectiveness of the protocol.