Deniable Authentication Protocol Research Articles

Enhancing privacy in cyber–physical systems: An efficient blockchain-assisted data-sharing scheme with deniability

The data in Cyber–Physical Systems (CPSs) is currently undergoing an explosive surge. Blockchain-based CPS exhibit enhancements in security, fault tolerance, and trust for its data sharing. However, it is very challenging to achieve the privacy preserving and efficient data sharing in CPS considering the privacy concerns introduced by blockchain while the cost associated with privacy protection cannot be neglected. To release these potential challenges, we propose a blockchain-assisted data-sharing scheme that ensures security, privacy-preserving and efficiency. We introduce deniability into data-sharing based on an identity-based deniable authentication protocol. This protocol enables data owners to deny their data-sharing actions, thereby protecting their privacy, while simultaneously providing recipients with the assurance of data verifiability. Furthermore, by incorporating multi-recipient encryption techniques, the proposed scheme significantly simplifies interactions with multiple recipients, reducing associated costs. Additionally, we propose a source traceability mechanism with the assistance of blockchain, establishing a distributed, transparent and trustworthy framework for data sharing, while ensuring honest cooperation between the individual participants. Security analysis and performance comparisons demonstrate the effectiveness and security of this scheme.

PF-IBDA: Provably secure and pairing-free identity-based deniable authentication protocol for MANET environments

Mobile Adhoc Network (MANET) is used in various real-time applications, such as e-voting, army tactical communication, health-care applications, disaster rescue, online message exchange, etc. However, source authentication and deniability are essential properties in such applications. Typically, these properties can be achieved using a deniable authentication (DA) protocol. With the help of a DA protocol, a mobile receiver node can directly verify the source, another mobile node, of a message without consulting a trusted third party (TTP). Recently, many identity-based deniable authentication (IBDA) protocols have been proposed. Most of these protocols are insecure and computationally expensive since they use costly operations, such as bilinear pairing and map-to-point hash function. We proposed a pairing-free identity-based deniable authentication (PF-IBDA) protocol for MANET environments. We proved that the PF-IBDA protocol could provide indistinguishability against adaptive chosen ciphertext attack (IND-CCA2) in the random oracle model (ROM) based on the hardness assumption of the elliptic curve computational Diffie–Hellman (ECCDH) problem. We have computed the execution time of PF-IBDA protocol in different security levels: 80-bit, 112-bit, 128-bit, 192-bit, and 256-bit on a mobile device using the JPBC library and compared it with the state-of-the-art IBDA protocols. We found that the proposed PF-IBDA protocol is more efficient than the existing IBDA protocols.

ID-Based Deniable Authentication Protocol with Key Agreement and Time-Bound Properties for 6G-Based WBAN Healthcare Environments

The advent of 6G technology is expected to bring a paradigm shift in the field of wireless communication. With its faster data transfer rates and lower latency, 6G could be an ideal solution for the challenges faced by Wireless Body Area Networks (WBANs) in terms of efficient data bandwidth and edge computing. Smart healthcare systems with 6G-based WBANs might provide more efficient and higher-quality healthcare services. However, 6G-based WBAN healthcare systems might face potential security and safety challenges from cybersecurity threats. This paper will propose an ID-based deniable authentication protocol with key agreement and time-bound properties for 6G-based WBAN healthcare environments by considering user privacy, secure communications, authentication, authorization, and scalability of 6G-based WBANs. As compared with previously proposed protocols, the proposed protocol will achieve the following security requirements: mutual authentication, key agreement for secure communication, deniability, time-bound access privilege control, and identity-based public key management for scalable wearable devices and 6G-based WBAN Service Providers. We proved the claimed security requirements of the proposed protocol by using AVISPA simulation and discussed its computational complexities. As compared with previous works, the proposed protocol can gain better contributions in terms of security requirements and performance evaluations for 6G-based WBAN healthcare environments.

A quantum deniable authentication protocol based on two-mode squeezed quantum states

A quantum deniable authentication protocol based on the theory of continuous quantum by using two-mode squeezed quantum states is proposed. By introducing the key agreement mechanism, the message sender and the specified receiver will first agree a new shared secret key by key update phases without the help of a third center and without their interaction by utilizing the amplitude and the phase properties of the entangled optical modes, and then the sender generates the message authentication code by using the new shared secret key. Security analysis results show that the protocol satisfies the basic security requirements of deniable authentication protocol such as completeness and deniability, and can withstand forgery attack, impersonation attack, inter-resend attack and beam splitter attack.

A practical and communication-efficient deniable authentication with source-hiding and its application on Wi-Fi privacy

Authentication service in communication is essential. However, information flows transmitted during an authentication process might reveal some personal information. In this paper, we propose a deniable authentication protocol with source hiding which does not reveal any private information, therefore the privacy of participants is preserved. With our approach, the sender is able to deny an authentication process to any third party. The receiver can not prove that the sender has participated in this authentication, though it is sure that the sender is legitimate. We construct this protocol without using “Encryption-then-MAC” paradigm, therefore the underlying building block is not required to be CCA2 secure, and is a more realistic authentication protocol for practical privacy-preserving Internet-based applications. We also show how to apply it in Wi-Fi authentication to prevent the location leakage.

A scheme on converting quantum deniable authentication into universal quantum designated verifier signature

The deniable authentication and designated verifier signature protocol can achieve the property of deniability by a transcript simulation algorithm, so two protocols are similar in the concepts and application scenarios. In this paper, we will avoid the research ideas of classical cryptography and research how to convert quantum deniable authentication protocol into quantum designated verifier signature in this universal case that the owner of the signature and the signer isn’t the same user in quantum designated verifier signature scheme such as electronic ID cards and e-passports. A mode on converting quantum deniable authentication into quantum designated verifier signature is firstly proposed by introducing quantum signature with public verifiability, including the entities and the implementation process converting, and then a real quantum designated verifier signature scheme is proposed, which satisfies all security requirements of a designated verifier signature scheme and can withstand intercept-resend attack and impersonation attack and entangle-measure attack.

Heterogeneous deniable authentication and its application to e-voting systems

An electronic voting (e-voting) system allows voters to cast their votes secretly and securely over a public channel. Security is the critical issue that should be considered in such a system. In this paper, we propose a heterogeneous deniable authentication (HDA) protocol for e-voting systems. The proposed protocol allows a sender in a certificateless cryptography (CLC) environment to transmit a message to a receiver in a public key infrastructure (PKI)environment. Our protocol admits security proof in the random oracle model under the bilinear Diffie–Hellman (BDH) and computational Diffie–Hellman (CDH) assumptions. Additionally, our protocol provides batch verification, which can accelerate the verification of authenticators. Comprehensive analysis shows that our protocol is highly suitable for practical e-voting systems.

A simplified deniable authentication scheme in cloud‐based pay‐TV system with privacy protection

SummaryCloud computing is a milestones for computing model, which enables on‐demand, flexible, and low‐cost usage of computing resources, especially for cloud storage. Nowadays, the services of cloud‐based pay‐TV systems are emerging endlessly. But these pay‐TV systems' privacy is not given enough attention. The users not only care about their information revealed during transmission processes but are also concerned about whether the video contents that they have seen were recorded by the pay‐TV systems or not. In this work, I propose a novel deniable authentication protocol in a cloud‐based pay‐TV system, named DAP‐TV, aiming to achieve mutual authentication, deniability, and privacy protection in cloud‐based pay‐TV systems. The unique feature of our scheme is deniability which means a pay‐TV system to identify a user is a legal user, but the pay‐TV system cannot prove video contents that the user has seen to any third party over an unsecured network. In additon, our scheme is based on chaotic maps, which is a highly efficient cryptosystem and is firstly used to construct a deniable authentication scheme in pay‐TV systems. Finally, we give the formal security proof and efficiency comparison with recently related works.

Comment on “A novel quantum deniable authentication protocol without entanglement”

Shi et al. (Quantum Inf Process 14(6):2183–2193, 2015) proposed a novel quantum deniable authentication protocol in which new shared secret keys can be updated timely with the help of a trusted party, and the fact that only the specified receiver could identify the true source of a given message is guaranteed by the new shared secret keys generated in the key update phase. Hence, the core of Shi et al.’s protocol is the key update phase . However, the analysis in this paper shows that there is a bug in the key update phase, which can lead to the failure of updating the shared key. Furthermore, an improved simple method is proposed to mitigate the security weakness.

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.

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.

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.

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.