可否认加密与可否认协议-计算机软件与理论专业毕业论文.docxVIP

PAGE PAGE VI Abstract Deniability is an important notion that aims at protecting the privacy of users. Deniability has received significant attention. Deniability has a lot of applications to construction of deniable authentication protocol, deniable group key agreement and deniable encryption scheme. Deniable encryption is cryptosystem that allows a user (a sender and/or a receiver of messages) to deny the real parameters of encryption algorithms, and to provide fake parameters. But coercive adversary could not know the fraud. A deniable authentication protocol enables a receiver to identify the source of the given messages but unable to prove to a third party the identity of the sender. Group key agreement protocols are the focus of attention in the multicast security problems, and a deniable group key agreement can guarantee against malicious insiders. In this thesis, we made the following works on deniability: Analyzed the deniable encryption scheme proposed by Maged Hamada Ibrahim and others, we pointed that the scheme is not practical. By trusted third party, a scheme was presented, based HYPERLINK /search?q=the%2Bquadratic%2Bresiduosity%2Bproblemamp;le=engamp;keyfrom=dict.phrase.wordgroup on the quadratic residuosity problem. It realized sender and receiver deniable encryption and could perform multi-bit message encryption. Semantic security of the scheme was proved. The scheme is practical. Mentioned the non-interactive deniable authentication scheme based on designated verifier signature proposed by Bin Wang and others, and analyzed the interaction, the security, the deniability, the efficiency and so on, we pointed that the protocol possesses strong deniability but not complete deniability. Based key sharing system of ID (SOK key sharing system), an improved scheme is proposed. In the improved scheme, the prover produces the authenticator Authen by encrypting the message M under a shared key KPV and the verifier can also produces