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 Journal of Computers and Applications

A novel certificateless deniable authentication protocol

Chunhua Jin, Chunxiang Xu, Fagen Li, Xiaojun Zhang

Published Oct 2, 2015• 8 citations
Publisher

Abstract

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.

DOI
10.1080/1206212x.2016.1188564

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

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

An Efficient Identity-Based Deniable Authenticated Encryption Scheme

Weifeng Wu, Fagen Li

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.

KSII Transactions on Internet and Information Systems•May 30, 2015•17 citations

Yet Another Certificateless Three-Party Authenticated Key Agreement Protocol

Jianbin Hu, Hu Xiong, Zhi Guan +4 more

Key agreement protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities and which cannot be predetermined by any party. Recently, the notion of certificateless public key cryptography was introduced to mitigate the heavy certificate management burden in traditional public key infrastructure and key escrow problem in ID-based cryptosystem. In this paper, we present an efficient certificateless three-party authenticated key agreement protocol based on certificateless signature scheme. We show that the proposed protocol is secure (i.e. conforms to defined security attributes) while being efficient.

IEEE International Symposium on Parallel and Distributed Processing with Applications (ISPA)•May 1, 2011•1 citation

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

Certificateless two-party authenticated key agreement protocol based on bilinear pairings

Yuezhi Zhou

Certificateless public key cryptography has appealing features,namely it does not require the use of certificates and does not have a private key escrow feature.This paper describes a certificateless key agreement protocol based on bilinear pairings.The identity authentication in the protocol depends on a digital signature scheme.This paper proves the security of the signature scheme.The results show that in the random oracle model with the discrete logarithm assumption,the signature scheme resists existential forgeries against adaptive chosen-message attacks.The results farther show that the protocol preserves the desired security properties,including known-key security,unknown key-share resilience,perfect forward secrecy,key-compromise impersonation resilience and leakage of ephemeral private key resilience.The protocol requires much lower computation overhead than related protocols,since it uses fewer bilinear pairing operations and no modular exponentiation.

Journal of Tsinghua University(Science and Technology)•Jan 1, 2012•1 citation
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.
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.
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 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.
Key agreement protocols are multi-party protocols in which entities exchange public information allowing them to create a common secret key that is known only to those entities and which cannot be predetermined by any party. Recently, the notion of certificateless public key cryptography was introduced to mitigate the heavy certificate management burden in traditional public key infrastructure and key escrow problem in ID-based cryptosystem. In this paper, we present an efficient certificateless three-party authenticated key agreement protocol based on certificateless signature scheme. We show that the proposed protocol is secure (i.e. conforms to defined security attributes) while being efficient.
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.
Certificateless public key cryptography has appealing features,namely it does not require the use of certificates and does not have a private key escrow feature.This paper describes a certificateless key agreement protocol based on bilinear pairings.The identity authentication in the protocol depends on a digital signature scheme.This paper proves the security of the signature scheme.The results show that in the random oracle model with the discrete logarithm assumption,the signature scheme resists existential forgeries against adaptive chosen-message attacks.The results farther show that the protocol preserves the desired security properties,including known-key security,unknown key-share resilience,perfect forward secrecy,key-compromise impersonation resilience and leakage of ephemeral private key resilience.The protocol requires much lower computation overhead than related protocols,since it uses fewer bilinear pairing operations and no modular exponentiation.