Non-interactive Deniable Authentication Protocol Research Articles

ID-based non-interactive deniable authentication protocol

Non-interactive deniable authentication protocol can enable the receiver to identify the source of a received message and prevent a third party from identifying the source of the message,which is very suitable to be used in E-commerce and E-government.Based on computational Diffie-Hellman assumption,using bilinear pairing,a new identity-based deniable authentication protocol was constructed.The security of the scheme was proved under the random oracle model.The analytical results show that the new proposed protocol can resist the forgery attack,spoofing attack,middle attack and replay attack.This protocol is identity-based,which means it needs no certificate and has a simple key management.On the other hand,it is efficient in communications and computation,and its implementation is simple,so that it could be implemented in mobile devices with low power and small processor.

Cryptanalysis of a Non-interactive Deniable Authentication Protocol Based on Factoring

A deniable authentication protocol allows a sender to transfer an authenticated message to a receiver in such a way that the receiver cannot prove to a third party about the source of the message. In recent years, many deniable authentication protocols have been proposed. In 2005, Lu et al. proposed a secure and non-interactive deniable authentication protocol based on factoring. Although Lu et al. claimed that their protocol could provide complete security and properties of a deniable authentication protocol, we will point out that Lu et al. protocol is unable to achieve the second requirement of being the deniable authentication protocol.

Confidential deniable authentication using promised signcryption

In a deniable authentication protocol, a receiver is convinced that a received message is indeed from a particular sender, but cannot prove this to any third party. Deniable authentication protocols satisfy deniability and intended receiver properties. Among the proposed deniable authentication protocols, non-interactive protocols are more efficient than interactive protocols by reducing communication cost. The Hwang and Ma, and the Hwang and Chao non-interactive protocols provide sender anonymity. Recently some interactive protocols provide confidentiality while no non-interactive protocols do. However, the transferred data may damage sender or receiver anonymity. To provide confidentiality and anonymity efficiently, the first promised signcryption scheme is proposed. Using our promised signcryption scheme, we propose the first efficient non-interactive deniable authentication protocol with confidentiality, sender anonymity, and sender protection.

A Non-interactive Deniable Authentication Protocol based on Elliptic Curve Discrete Logarithm Problem

A Non-interactive Deniable Authentication Protocol based on Elliptic Curve Discrete Logarithm Problem

An efficient non-interactive deniable authentication protocol with anonymous sender protection

Deniable authentication protocols satisfy two basic properties: Deniability and the specifiable receiver properties. However, the deniability also damages the sender right. To protect senders, Hwang and Ma first proposed deniable authentication with anonymous sender protection. The sender’s anonymity is also used to protect the sender’s privacy. To reduce the computation cost, an efficient deniable authentication protocol is proposed. Our new protocol not only achieves the two properties but also provides the protection of sender and receiver to keep the privacy of the sender and receiver. Though the sent message is forgeable by receivers, but the sender can provide evidence to prove the message was really sent by him/her. Due to the efficient performance, our protocol is more practical than the other protocols in the real world.

A Secure Internet Voting Protocol Based on Non-interactive Deniable Authentication Protocol and Proof Protocol that Two Ciphertexts are Encryption of the Same Plaintext

Internet voting protocol is the base of the Internet voting systems. Firstly, an improved proof protocol that two ciphertexts are encryption of the same plaintext is introduced. Secondly, a receipt-free and coercion-resistant Internet voting protocol based on the non-interactive deniable authentication protocol and an improved proof protocol that two ciphertexts are encryption of the same plaintext is developed. Thirdly, we analyze the proposed Internet voting protocol. The proposed Internet voting protocol has the properties of universal verifiability, receiptfreeness and coercion-resistance. At the same time the proposed protocol is with the weak physical assumption. Lastly, we compare security properties of the several typical Internet voting protocols with our present protocol.

A Secure Non-Interactive Deniable Authentication Protocol with Strong Deniability Based on Discrete Logarithm Problem and its Application on Internet Voting Protocol

A Secure Non-Interactive Deniable Authentication Protocol with Strong Deniability Based on Discrete Logarithm Problem and its Application on Internet Voting Protocol

Erratum to “Non-interactive deniable authentication protocol based on factoring”[Computer Standards & Interfaces 27 (2005) 401–405

Erratum to “Non-interactive deniable authentication protocol based on factoring”[Computer Standards & Interfaces 27 (2005) 401–405

A novel deniable authentication protocol using generalized ElGamal signature scheme

A deniable authentication protocol enables a receiver to identify the true source of a given message, but not to prove the identity of the sender to a third party. This property is very useful for providing secure negotiation over the Internet. Consequently, many interactive and non-interactive deniable authentication protocols have been proposed. However, the interactive manner makes deniable protocols inefficient. In addition, a security hole is generated in deniable protocols that use the non-interactive manner if a session secret is compromised. Thus, there is no secure and efficient deniable authentication protocol as of now. In this paper, a new protocol based on the non-interactive manner is proposed to efficiently and securely achieve deniable authentication. This protocol can furthermore replace the underlying signature scheme in order to retain a secure status even if the previously used signature method is broken.

Identity-based deniable authentication protocol

A new and non-interactive deniable authentication protocol, which is based on identity cryptography, is presented. It has no need for use of certificates. Moreover, the non-interactive protocol is practical in some applications that do not allow for interaction.

A new deniable authentication protocol from bilinear pairings

Deniable authentication protocol is a new technique of modern cryptography, and several such schemes have been proposed. However, to our knowledge, most of these schemes are interactive and less efficient, and only Shao proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme. Therefore, there is a desire to design other secure and efficient non-interactive deniable authentication protocol. In this paper, based on the bilinear pairings, we would like to propose such a new non-interactive deniable authentication protocol. What’s more, we also prove the proposed protocol is secure in the random oracle model.

Non-interactive deniable authentication protocol based on factoring

Deniable authentication protocol is a new cryptographic authentication protocol that enables a specified receiver to identify the source of a given message, but not prove the identity of the sender to a third party. In recent years, many deniable authentication protocols have been proposed. However, most of these proposed schemes are interactive and less efficient. To our knowledge, only Shao has proposed an efficient non-interactive deniable authentication protocol based on generalized ElGamal signature scheme. Therefore, in this paper, we would like to propose another non-interactive deniable authentication protocol based on factoring. What's more, we also prove it is secure in the random oracle model.

Improvement of Fan et al.’s deniable authentication protocol based on Diffie–Hellman algorithm

Recently, an efficient and non-interactive deniable authentication protocol based on the Diffie–Hellman key distribution protocol is presented by Fan et al. to enable a receiver to identify the source of a given message, but not prove the identity of the sender to a third party. In this paper, we point out that it suffers from an authentication flaw similar to that developed by Lowe to Intruder masquerades as other principals and inquisitor INQ can identify the source of the message unlike their claims. Accordingly, we propose an improved protocol to overcome the weaknesses.

Efficient deniable authentication protocol based on generalized ElGamal signature scheme

An efficient and non-interactive deniable authentication protocol is presented to enable a receiver to identify the source of a given message, but not prove the identity of the sender to a third party. The proposed protocol is based on the generalized ElGamal signature scheme and is more efficient than the previous protocols. We show that if an adversary could forge signatures of this protocol, he would forge signatures of the generalized ElGamal signature scheme. Moreover, the new protocol is more secure than the previous deniable authentication protocols, since anyone can not impersonate the intended receiver.