Deniable Authentication Research Articles

Certificateless deniably authenticated encryption and its application to e-voting system

The concept of deniably authenticated encryption (DAE) is presently significant in cryptography due to its security properties and wide range of application. It achieves deniable authentication and confidentiality in a simultaneous manner. It has merited application in e-voting systems, e-mail systems and confidential online negotiation. Although several DAE schemes have been proposed recently, we point out that those constructions are either weak against masquerading attacks or inherent key escrow problem. As a remedy, we propose a certificateless deniably authenticated encryption (CLDAE) scheme that is provably secure. Typically, we can obtain this goal using the “deniable authentication followed by certificateless encryption” approach. However, this approach is computationally expensive and complex to design since it is a combination of two cryptographic constructions. In contrast, our CLDAE scheme is a single cryptographic construction but it concurrently accomplishes the requirements of public key encryption and deniable authentication at a relatively lower cost. For instance, our simulation results at 80 bits of security level shows up to be approximately 43.3 and $$30.4\%$$ respectively faster than two “deniable authentication followed by certificateless encryption” schemes. Moreover, the communication overhead of our CLDAE scheme is 12.9 and $$34.9\%$$ lesser than that of those two schemes respectively. Finally, to demonstrate the significance of our CLDAE scheme, we apply it to a real world application such as e-voting system.

Deniable authenticated encryption for e-mail applications

ABSTRACTIn this paper, we introduce a deniable electronic mail authenticated encryption service. Our design meets the security requirement of the current Pretty Good Privacy and Secure/Multipurpose Internet Mail Extensions to provide message confidentiality and message authentication without the undesired non-repudiation, which can protect the individual privacy of the sender when communication occurs in open channels. Our scheme is based on the bilinear pairings, which is provably secure in the random oracle model under the bilinear Diffie-Hellman and computational Diffie-Hellman assumptions. In addition, our scheme needs a little high communication overhead. However, this extra cost is reasonable for the properties of deniable authentication, confidentiality, and ciphertext anonymity.

New Approach for Privacy-Aware Location-Based Service Communications

Location-based services (LBS) are very popular for personal communications in the mobile Internet. In such applications, users make use of the mobile devices to obtain the information of the nearest gas stations, restaurants, banks etc from service provider (SP), as well as identification of the optimal route to reach destination according to user position. Obviously, location data is effective for service provisioning. Therefore, the privacy threat is the inherent problem in LBS. Previous known solutions for privacy-preserving LBS require to blind the location data to SP. Consequently, it certainly suffers from a privacy/quality of service trade-off. We present a new approach to handle such problem for privacy-aware LBS communications. In our protocol, the user submits the exact location to SP to obtain the high quality service, while his location data and the communication transcript cannot be the evidence to be obtained by any third party. Hence the privacy of this user is preserved. We take the deniable (ring) authentication as the building blocks. In this way, it is not necessary for the user to provide coarse location information which would degrade the service quality certainly.

A Restricted Quantum Deniable Authentication Protocol Based on GHZ States

Utilizing the property of unitary transformation and Greenberger-Horne-Zeilinger (GHZ) states, a restricted quantum deniable authentication protocol is proposed. The protocol can provide that the sender can deny the content of the sent message, but cannot deny taking part in a certain communication. Security analysis results show that this protocol can satisfy known key security and the basic security requirements of restricted deniable authentication protocol such as completeness, restricted deniability, no-counterfeiting and can withstand impersonation attack, intercept-resend attack.

A provably secure code‐based short signature scheme and its nontransferable variant

SummarySignatures with partially message recovery in which some parts of messages are not transmitted with signatures to make them shorter are helpful where bandwidth is one of the critical concern. This primitive is especially used for signing short messages in applications such as time stamping, certified email services, and identity‐based cryptosystems. In this paper, to have quantum‐attack‐resistant short signatures, the first signature scheme with partially message recovery based on coding theory is presented. Next, it is shown that the proposal is secure under Goppa Parametrized Bounded Decoding and the Goppa Code Distinguishing assumptions in the random oracle model. Relying on the partially message recovery property, the proposal is shorter than Dallot signature scheme, the only provably secure and practical code‐based signature scheme, while it preserves Dallot signature efficiency. We should highlight that our scheme can be used as a building block to construct short code‐based signature schemes with special properties. To show this, we present a provably secure short designated verifier signature scheme, a nontransferable form of short signatures, which is used in electronic voting and deniable authentication protocols.

Certificateless Aggregate Deniable Authentication Protocol for Ad Hoc Networks

Deniable authentication allows a receiver to identify the source of a given message, but cannot prove the source of a given message to any third party. It can be employed in electronic voting (e-voting) systems, electronic tendering (e-tendering) systems and secure networks negotiation. These applications can be well realised in ad hoc networks. Therefore, deniable authentication is an essential security requirement for ad hoc networks. Aggregate deniable authentication is a method for combining n authenticator of n distinct messages from n distinct users into one single authenticator. This feature is very attractive in bandwidth-limited ad hoc networks. In this paper, we present an efficient certificateless aggregate deniable authentication protocol. Our protocol is based on certificateless public key cryptography that has neither the public key certificates management problem in traditional public key infrastructure (PKI) cryptography nor the key escrow problem in identity-based cryptography. The security of our protocol can be proven in the random oracle model under the bilinear Diffie-Hellman (BDH) and computational Diffie-Hellman (CDH) problems. In addition, our protocol adopts aggregate verification that can speed up the verification of authenticators. Our protocol is very suitable for ad hoc networks.

Certificateless aggregate deniable authentication protocol for ad hoc networks

Deniable authentication allows a receiver to identify the source of a given message, but cannot prove the source of a given message to any third party. It can be employed in electronic voting (e-voting) systems, electronic tendering (e-tendering) systems and secure networks negotiation. These applications can be well realised in ad hoc networks. Therefore, deniable authentication is an essential security requirement for ad hoc networks. Aggregate deniable authentication is a method for combining n authenticator of n distinct messages from n distinct users into one single authenticator. This feature is very attractive in bandwidth-limited ad hoc networks. In this paper, we present an efficient certificateless aggregate deniable authentication protocol. Our protocol is based on certificateless public key cryptography that has neither the public key certificates management problem in traditional public key infrastructure (PKI) cryptography nor the key escrow problem in identity-based cryptography. The security of our protocol can be proven in the random oracle model under the bilinear Diffie-Hellman (BDH) and computational Diffie-Hellman (CDH) problems. In addition, our protocol adopts aggregate verification that can speed up the verification of authenticators. Our protocol is very suitable for ad hoc networks.

A restricted quantum deniable authentication protocol applied in electronic voting system

In some actual network such as electronic voting system, in order to count the number of the participants, the voters cannot deny taking part in a certain voting activity but the voters need deny the content of the voting. However the proposed quantum deniable authentication protocols cannot meet the above specific needs. Hence a restricted quantum deniable authentication protocol based on asymmetric quantum cryptography is proposed in this paper. Utilizing single-qubit rotations and one-way functions, this protocol can provide that the voter can deny the content of the sent message, but cannot deny taking part in electronic voting. Compared with our previous schemes, this new scheme has the remarkable advantages. Finally, security analysis results show that this protocol satisfies the basic security requirements of restricted deniable authentication protocol such as completeness, restricted deniability and no-counterfeiting.

An Efficient Chaotic Maps-Based Deniable Authentication Group Key Agreement Protocol

More than two participants implement communication over the network at the same time, aiming to establish a common session key, and it is named group session communication. Nowadays, many researchers lay emphasis on achieve a perfect group key agreement protocol in order to resist various attacks and complete mutual authentication for every two-party among them. Actually, investigators have overlooked an important issue called insider attack, which the inner participants could disclose the source of the messages to outsider parties. Therefore, in this paper, we present a novel group key agreement protocol with deniable authentication to against insider attack. After achieve the process of deniable authentication, the group participants unable to reveal the source of the messages to another party because any subgroup participants still can simulate the whole transcript process. Meanwhile, our protocol based on chaotic maps algorithm, which enhance the calculation efficiency and realize the goal of privacy protection successful.

A Non-interactive Deniable Authentication Scheme in the Standard Model

Deniable authentication protocols enable a sender to authenticate a message to a receiver such that the receiver is unable to prove the identity of the sender to a third party. In contrast to interactive schemes, non-interactive deniable authentication schemes improve communication efficiency. Currently, several non-interactive deniable authentication schemes have been proposed with provable security in the random oracle model. In this paper, we study the problem of constructing non-interactive deniable authentication scheme secure in the standard model without bilinear groups. An efficient non-interactive deniable authentication scheme is presented by combining the Diffie-Hellman key exchange protocol with authenticated encryption schemes. We prove the security of our scheme by sequences of games and show that the computational cost of our construction can be dramatically reduced by applying pre-computation technique.

Efficient Deniably Authenticated Encryption and Its Application to E-Mail

Confidentiality and authentication are two main security goals in secure electronic mail (e-mail). Pretty good privacy (PGP) and secure/multipurpose internet mail extensions (S/MIME) are two famous secure e-mail solutions. Both PGP and S/MIME use digital envelope to provide message confidentiality and digital signature to provide message authentication. However, these methods have the following two weaknesses: 1) digital signature provides non-repudiation evidence of sender that is not desired in some e-mail applications and 2) efficiency is low, since these methods use two kinds of public key cryptographic primitives: public key encryption and digital signature. To overcome the above two weaknesses, we introduce a new concept called deniably authenticated encryption that can achieve confidentiality, integrity, and deniable authentication in a logical single step. We first propose a deniably authenticated encryption scheme and prove its security in the random oracle model. Then, we design a secure e-mail protocol using the proposed deniably authenticated encryption scheme. The deniable authentication property protects senders’ privacy.

Practical deniable authentication for pervasive computing environments

Pervasive computing environments allow users to get services anytime and anywhere. Security has become a great challenge in pervasive computing environments because of its heterogeneity, openness, mobility and dynamicity. In this paper, we propose two heterogeneous deniable authentication protocols for pervasive computing environments using bilinear pairings. The first protocol allows a sender in a public key infrastructure (PKI) environment to send a message to a receiver in an identity-based cryptography (IBC) environment. The second protocol allows a sender in the IBC environment to send a message to a receiver in the PKI environment. Our protocols admits formal security proof in the random oracle model under the bilinear Diffie–Hellman assumption. In addition, our protocols support batch verification that can speed up the verification of authenticators. The characteristic makes our protocols useful in pervasive computing environments.

A non-interactive quantum deniable authentication protocol based on asymmetric quantum cryptography

In order to reduce the communication cost, a non-interactive quantum deniable authentication based on asymmetric quantum cryptography is proposed. In the new scheme, the sender and receiver without interaction first agree a sharing secret key by utilizing their public and private key and then the sender generates the authentication information according to the sharing secret key, similarly, the receiver can also generate the same authentication codes according to the sharing secret key. So the receiver cannot prove the source of the message to a third party but can identify the true source of a given message. Compared with our previous schemes based on interaction, this new scheme has the remarkable advantages of reducing the communication cost, lessening the difficulty and intensity of necessary operations, and without help of a trusted center. Finally, the security analysis results show that this new scheme also satisfies the same basic security requirements of deniable authentication protocol such as completeness, deniability, and can withstand forgery attack, impersonation attack and inter-resend attack.

An efficient quantum deniable authentication protocol without a trusted center

Recently, we first proposed a quantum deniable authentication protocol based on the property of unitary transformation and quantum one-way function, but the previous scheme needs the help of a trusted center and its quantum efficiency is only 25% [Quantum Inf Process. (2014). doi:10.1007/s11128-014-0743-9]. In order to improve the above scheme efficiency, a simple and effective quantum deniable authentication protocol without a trusted center is proposed. Utilizing the method of key agreement and encryption mechanism, this scheme can provide that only the specified receiver can identify the true source of a given message and the specified receiver cannot prove the source of the message to a third party by a transcript simulation algorithm. Finally, efficiency analysis results show quantum efficiency of this scheme will be 50% and it also has the remarkable advantages of consuming fewer quantum resources and lessening the difficulty and intensity of necessary operations. In addition, security analysis results show that this scheme also satisfies the basic security requirements of deniable authentication protocol such as completeness, deniability, and can withstand forgery attack, impersonation attack and inter-resend attack.

Cryptanalysis of an Improvement of Robust Deniable Authentication Protocol

Deniable authentication protocol, as an advanced method of authentication, enables the intended receiver of a given message to identify the source of the message while preventing the receiver to prove this source to a third party. In 2013, Li and Takagi proposed an enhanced model of Yoon et al’s robust deniable authentication protocol and claimed that their model could achieve the property of deniable authenticity. The present study reviews and analyses Li and Takagi’s suggested model and argues that this model still needs improvement to satisfy deniability.

Identity-based deniable authenticated encryption and its application to e-mail system

An authenticated (AE) scheme simultaneously achieves two security goals: confidentiality and authenticity. AE can be divided into symmetric AE and asymmetrical (public key) AE. In a symmetric AE scheme, deniability is gained automatically. However, a public key AE scheme can not gain deniability automatically; on the contrary, it provides non-repudiation. In this paper, we address a question on deniability of public key AE. Of course, we can achieve this goal by authentication followed by encryption method. However, such method has the following two weaknesses: (1) the computational cost and communication overhead are the sum of two cryptographic primitives; (2) it is complex to design cryptographic protocols with deniable authentication and confidentiality using two cryptographic primitives. To overcome the two weaknesses, we propose a new concept called deniable authenticated (DAE) that can achieve both the functions of deniable authentication and public key simultaneously, at a cost significantly lower than that required by the authentication followed by encryption method. This single cryptographic primitive can simplify the design of cryptographic protocols with deniable authentication and confidentiality. In particular, we construct an identity-based deniable authenticated (IBDAE) scheme. Our construction uses tag-key encapsulation mechanism (KEM) and data encapsulation mechanism (DEM) hybrid techniques, which is more practical for true applications. We show how to construct an IBDAE scheme using an identity-based deniable authenticated tag-KEM (IBDATK) and a DEM. We also propose an IBDATK scheme and prove its security in the random oracle model. For typical security level, our scheme is at least 50.7 and 22.7 % faster than two straightforward authentication followed by encryption schemes, respectively. The communication overhead is respectively reduced at least 21.3 and 31.1 %. An application of IBDAE to an e-mail system is described.

A novel certificateless deniable authentication protocol

Deniable authenticate is a different and attractive authenticate mechanism compared with the traditional authentication. It allows the appointed receiver to identify the identity of the sender, but not to prove the source of a given message to a third party even if the appointed receiver is willing to reveal its private key. Certificateless public key cryptography can solve both the public key certificate management problem of public key infrastructure-based cryptography and the key escrow problem of identity-based cryptography. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol. In addition, we prove its security in the random oracle model. Our protocol can be applied in many actual application scenarios, such as electronic voting, electronic tendering, and online shopping.

A Deniable Group Key Authentication Scheme under Random Oracle Model

A Deniable Group Key Authentication Scheme under Random Oracle Model

An Efficient Identity-Based Deniable Authenticated Encryption Scheme

Deniable authentication protocol allows a sender to deny his/her involvement after the protocol run and a receiver can identify the true source of a given message. Meanwhile, the receiver has no ability to convince any third party of the fact that the message was sent by the specific sender. However, most of the proposed protocols didn’t achieve confidentiality of the transmitted message. But, in some special application scenarios such as e-mail system, electronic voting and Internet negotiations, not only the property of deniable authentication but also message confidentiality are needed. To settle this problem, in this paper, we present a non-interactive identity-based deniable authenticated encryption (IBDAE) scheme using pairings. We give the security model and formal proof of the presented IBDAE scheme in the random oracle model under bilinear Diffie-Hellman (BDH) assumption.

A novel quantum deniable authentication protocol without entanglement

A novel quantum deniable authentication protocol based on single photons is proposed. In this scheme, the message sender and the specified receiver will first agree a new shared secret key by key update phases with the help of a third center, where only they can encrypt and decrypt the message by using the new shared secret key. Hence, this scheme can guarantee that only the specified receiver can identify the true source of a given message and the specified receiver cannot prove the source of the message to a third party by a transcript simulation algorithm. Compared with our previous scheme (Shi et al. in Quantum Inf Process 13:1501---1510, 2014), this scheme has the remarkable advantages of the higher qubit efficiency and consuming fewer quantum resources. Finally, security analysis results show that this scheme satisfies known key security and the basic security requirements of deniable authentication protocol such as completeness and deniability, and can withstand forgery attack, impersonation attack and inter-resend attack.