Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Conference on Computer Networks and Communication Technology (CNCT)

A Simple Deniable Authentication Protocol Based on Quantum Key Distribution

Chenhui Jin, Zhiyong Li, Su-hua LIAO

Published Jan 1, 2017• 1 citation
Publisher

Abstract

A deniable authentication protocol enables a receiver to identify the true source of 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.Recently, Shi et al. proposed a quantum deniable authentication protocol based on the property of unitary transformation and quantum one-way function.A trusted center (TC) is introduced in their protocol, and a much amount of quantum resources, such as entanglement, quantum memory and quantum one-way function, are required.In this paper, a deniable authentication protocol without a trust center is proposed based on the quantum key distribution (QKD).In the presented protocol, the QKD is used firstly to share a secret key between the sender and the receiver.Then, the shared key is used to identify the true source of sender's message by the receiver.Finally, the simulation based proof shows that the receiver cannot prove the identity of the sender to any third party.

DOI
10.2991/cnct-16.2017.112

Related papers

A novel certificateless deniable authentication protocol.

Chunhua Jin, Chunxiang Xu, Xiaojun Zhang +2 more

Abstract: Deniable authenticated protocol is a new and attractive protocol compared to the traditional authentication protocol. It allows the appointed receiver to identify the source of a given message, but not to prove the identity of the sender to a third party even if the appointed receiver is willing to reveal its private key. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol, by combining deniable authentication protocol with certificateless cryptography. In addition, we prove its security in the random oracle model.

•Jan 1, 2013•0 citations

Universal Encrypted Deniable Authentication Protocol.

Zhenfu Cao

The notion of deniable authentication protocol was introduced in 1998 by Dwork et al. [11] and Aumann and Rabin [1, 2] independently. As a new cryptographic authentication protocol, a deniable authentication protocol enables an intended receiver to identify the source of a given message without being able to prove the identity of the sender to a third party. Over the past years, many deniable authentication protocols have been proposed. In this paper, we would like to present a universal encrypted deniable authentication protocol from any public key encryption scheme. Provided that the public key encryption scheme is secure, a secure deniable authentication protocol can be directly derived.

International journal of network security•Jan 1, 2009•3 citations

An efficient certificateless deniable authentication protocol without pairings

Chunhua Jin, Chunxiang Xu, Xiaojun Zhang +1 more

A deniable authentication protocol enables an intended receiver to identify the source of a given message, but the receiver cannot prove the source of a given message to any third party. It is very useful in some particular applications such as electronic voting, online negotiation and online shopping. However, many related protocols are lack of formal security proof which is very important for cryptographic protocol design. In this paper, we present a certificateless deniable authentication protocol. Our protocol is based on certificateless cryptography, which can solve the public key certificate management problem of public key infrastructure (PKI)-based cryptography and the key escrow problem of identity-based cryptography. Our protocol does not need the pairing operation which is the most time-consuming. In addition, our protocol can admit formal security proof in the random oracle model and resist key compromise impersonation (KCI) attack. Compared with the existing deniable authentication protocols, our protocol can be well applied in electronic voting system.

International Journal of Electronic Security and Digital Forensics•Jan 1, 2015•8 citations

A novel certificateless deniable authentication protocol

Chunhua Jin, Chunxiang Xu, Fagen Li +1 more

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.

International Journal of Computers and Applications•Oct 2, 2015•8 citations

Quantum mutual authentication scheme based on Bell state measurement

Muneer Alshowkan, Khaled M. Elleithy

Authentication is one of the security services that ensures sufficient security of the system by identification and verification. Also, it assures the identity of the communicating party to be that the claimed one. To build a quantum channel between two unauthenticated to each other parties, first, a trusted authority is needed to establish a mutual authentication with each party. Using Bell measurement and entanglement swapping, we present a protocol that mutually authenticates the identity of the sender and the receiver, then constructs a quantum channel based on Bell basis. After, the sender and the receiver use the quantum channel to communicate using entanglement-assisted quantum communication protocols. Additionally, the protocol renews the shared secret key between the trusted authority and each user after each authentication process. The protocol provides the necessary authentication and key distribution to create a quantum channel between the sender and receiver.

IEEE Long Island Systems, Applications and Technology Conference (LISAT)•Apr 1, 2016•4 citations

Three-Party Authentication using Quantum Key Distribution Protocols

P. Kalamani, Sujith nair.P

This project presents Quantum Key Distribution Protocols (QKDPs) to safeguard security in massive networks, by mistreatment DES algorithmic rule for secret writing and decryption of .txt file. In this project, secure communication between the sender and also the receiver is being created attainable through a trusted center by mistreatment secret key authentication. The trustworthy Center distributes a quantum key to each the sender and also the receiver when the verification of the secret key. The sender encrypts the info and sends to the receiver side solely when getting the quantum key from the Trusted Center. Similarly the decoding method happens. RSA algorithmic rule is getting used for quantum key distribution. and the input txt file is retrieved on the receiver aspect.

Journal of Emerging Technologies and Innovative Research•Feb 1, 2019•0 citations
A deniable authentication protocol enables a receiver to identify the true source of 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.Recently, Shi et al. proposed a quantum deniable authentication protocol based on the property of unitary transformation and quantum one-way function.A trusted center (TC) is introduced in their protocol, and a much amount of quantum resources, such as entanglement, quantum memory and quantum one-way function, are required.In this paper, a deniable authentication protocol without a trust center is proposed based on the quantum key distribution (QKD).In the presented protocol, the QKD is used firstly to share a secret key between the sender and the receiver.Then, the shared key is used to identify the true source of sender's message by the receiver.Finally, the simulation based proof shows that the receiver cannot prove the identity of the sender to any third party.
Abstract: Deniable authenticated protocol is a new and attractive protocol compared to the traditional authentication protocol. It allows the appointed receiver to identify the source of a given message, but not to prove the identity of the sender to a third party even if the appointed receiver is willing to reveal its private key. In this paper, we first define a security model for certificateless deniable authentication protocols. Then we propose a non-interactive certificateless deniable authentication protocol, by combining deniable authentication protocol with certificateless cryptography. In addition, we prove its security in the random oracle model.
The notion of deniable authentication protocol was introduced in 1998 by Dwork et al. [11] and Aumann and Rabin [1, 2] independently. As a new cryptographic authentication protocol, a deniable authentication protocol enables an intended receiver to identify the source of a given message without being able to prove the identity of the sender to a third party. Over the past years, many deniable authentication protocols have been proposed. In this paper, we would like to present a universal encrypted deniable authentication protocol from any public key encryption scheme. Provided that the public key encryption scheme is secure, a secure deniable authentication protocol can be directly derived.
A deniable authentication protocol enables an intended receiver to identify the source of a given message, but the receiver cannot prove the source of a given message to any third party. It is very useful in some particular applications such as electronic voting, online negotiation and online shopping. However, many related protocols are lack of formal security proof which is very important for cryptographic protocol design. In this paper, we present a certificateless deniable authentication protocol. Our protocol is based on certificateless cryptography, which can solve the public key certificate management problem of public key infrastructure (PKI)-based cryptography and the key escrow problem of identity-based cryptography. Our protocol does not need the pairing operation which is the most time-consuming. In addition, our protocol can admit formal security proof in the random oracle model and resist key compromise impersonation (KCI) attack. Compared with the existing deniable authentication protocols, our protocol can be well applied in electronic voting system.
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.
Authentication is one of the security services that ensures sufficient security of the system by identification and verification. Also, it assures the identity of the communicating party to be that the claimed one. To build a quantum channel between two unauthenticated to each other parties, first, a trusted authority is needed to establish a mutual authentication with each party. Using Bell measurement and entanglement swapping, we present a protocol that mutually authenticates the identity of the sender and the receiver, then constructs a quantum channel based on Bell basis. After, the sender and the receiver use the quantum channel to communicate using entanglement-assisted quantum communication protocols. Additionally, the protocol renews the shared secret key between the trusted authority and each user after each authentication process. The protocol provides the necessary authentication and key distribution to create a quantum channel between the sender and receiver.
This project presents Quantum Key Distribution Protocols (QKDPs) to safeguard security in massive networks, by mistreatment DES algorithmic rule for secret writing and decryption of .txt file. In this project, secure communication between the sender and also the receiver is being created attainable through a trusted center by mistreatment secret key authentication. The trustworthy Center distributes a quantum key to each the sender and also the receiver when the verification of the secret key. The sender encrypts the info and sends to the receiver side solely when getting the quantum key from the Trusted Center. Similarly the decoding method happens. RSA algorithmic rule is getting used for quantum key distribution. and the input txt file is retrieved on the receiver aspect.