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

Optik

A restricted quantum deniable authentication protocol applied in electronic voting system

Wei‐Min Shi, Yi‐Hua Zhou, Yu‐Guang Yang, Nan Jiang

Published May 18, 2017• 3 citations
Publisher
DOI
10.1016/j.ijleo.2017.05.050

Related papers

A novel quantum deniable authentication protocol without entanglement

Wei‐Min Shi, Jianbiao Zhang, Yi‐Hua Zhou +1 more

Quantum Information Processing•Apr 17, 2015•21 citations

Quantum deniable authentication protocol

Wei‐Min Shi, Yi‐Hua Zhou, Yu‐Guang Yang

Quantum Information Processing•Mar 16, 2014•23 citations

An efficient quantum deniable authentication protocol without a trusted center

Wei‐Min Shi, Yi‐Hua Zhou, Yu‐Guang Yang +2 more

Optik•Apr 30, 2016•2 citations

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

Wei‐Min Shi, Jan-Biao Zhang, Yi‐Hua Zhou +2 more

Optik•Jun 26, 2016•4 citations

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

Wei‐Min Shi, Binbin Chen, Yanmei Wang +2 more

Optik•Jun 22, 2020•1 citation

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 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.