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 Information and Network Security (IJINS)

Quantum password sharing scheme using trusted servers

Gabriela Mogos

Published Feb 10, 2013• 1 citation
Publisher

Abstract

The main purpose of the sharing schemes based on trusted servers is to obtain a password. The threshold cryptography aims the secret cryptographic protection, and is based on the distribution of the key on several servers, with the purpose to tolerate the attacks. In this work I will present a quantum version of the password sharing protocol, using a number n of trustful servers, to assure its security. The model I propose approaches the issue of the distribution of the authentication key between a client and n-1 servers.

DOI
10.11591/ijins.v2i3.1838

Related papers

A theoretical scheme for multi-user quantum authentication and key distribution in a network

Yu‐Guang Yang, Wen Qiao-yan, Fu-Chen Zhu +1 more

A theoretical scheme for multi-user quantum authentication and key distribution in a network is proposed. Similar to the authentication architecture of the netw ork in classical cryptography, a distributed client/server architecture with the shared Einstein-Podolsky-Rosen(EPR) entangled pairs between each user and his t rusted server used for the authentication and key distribution is proposed. Base d on this architecture, any-to-any multi-user quantum authentication and key dis tribution is realized. The trusted server only provides the authentication betwe en users and swaps the entanglement between the particles so as to entangle the particles of the two users who want to communicate secretly. The key generation is performed by the requesting user. Each user in a network only shares Einstein -Podolsky-Rosen entangled pairs with the trusted server and communicates with th e trusted server through the classical channel and quantum channel. Users need n ot share EPR entangled pairs with each other so that the number of EPR pairs in the network is reduced from O(n2) to O(n).

Acta Physica Sinica•Jan 1, 2005•9 citations

IDMS Quantum Password-Authenticated Key Exchange Protocols

Yingfei Xu, Yan Sun, Lu Zhang +1 more

In this paper, we design an ID-based M-server quantum password-authenticated key exchange scheme, where the client computes a strong key from its password and splits the key into m portions, and then encrypts them and sends them to m servers to be used as the basis for encryption and decryption in the subsequent key exchange process. The adoption of multiple servers can effectively prevent third-party attacks on the server and ensure the security of the key information, which is just like a complex secret sharing mechanism in traditional computational cryptography, for example, secret sharing (m, n) threshold scheme, but our new quantum fusion technology to realise the secret sharing mechanism is more efficient and simpler. Finally, through analysis, our scheme can meet most of the security requirements and perform well. It is feasible to implement the protocol under the existing quantum technology.

International Journal of Information and Computer Security•Jan 1, 2024•0 citations

An Efficient Simulation of Quantum Secret Sharing

Kartick Sutradhar, Hari Om

In quantum cryptography, quantum secret sharing $(QSS)$ is a fundamental primitive. $QSS$ can be used to create complex and secure multiparty quantum protocols. Existing $QSS$ protocols are either at the $(n, n)$ threshold $2$ level or at the $(t, n)$ threshold $d$ level with a trusted player, where $n$ denotes the number of players and $t$ denotes the threshold number of players. Here, we propose a secure $d$-level $QSS$ protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing $QSS$ protocols: $(n, n)$ threshold $2$-level and $(t,n)$ threshold $d$-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.

arXiv:2103.11206•Mar 20, 2021•7 citations

(t,n) Threshold Quantum Secret Sharing Scheme for Cloud Storage

Bai Liu, Shuheng Qi, Hao Chen

Abstract Secret sharing, as an important cryptographic technique, effectively reduces the risk of single points of failure and centralized leakage by distributing secret information across multiple independent entities. With the widespread application of cloud computing and cloud storage, achieving long-term secure storage and controllable recovery of sensitive data in untrusted cloud environments has become a critical issue. Traditional cloud storage solutions face potential risks of security degradation and privacy exposure under long-term operation and future quantum computing threats. This paper proposes a quantum secret sharing (QSS) scheme for cloud storage scenarios, combining the threshold secret sharing with quantum secure communication and quantum information processing to achieve distributed storage and secure reconstruction of secret information across multiple cloud servers. A quantum identity authentication mechanism is introduced to the authenticated user based on a quantum sequence. This protocol enhances the long-term security of the system during the storage phase through threshold distribution and proactive share refreshing mechanisms, and utilizes quantum states to complete the secure reconstruction of secrets during the recovery phase. Additionally, this scheme avoids direct interaction between cloud servers, improving the security in untrusted cloud environments. Security analysis shows that this protocol can effectively resist threats such as external eavesdropping and internal collusion.

Chinese Physics B•May 11, 2026•0 citations

An Efficient Quantum Secret Sharing Scheme Based on Restricted Threshold Access Structure

Lei Li, Zhi Zhou Li

Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.

Entropy•Jan 31, 2023•12 citations

Performance of integrated quantum and classical cryptographic model for password authentication

T. S. Thangavel, Aravind Krishnan

The security of quantum cryptography relies on the foundations of quantum mechanics, in contrast to traditional public key cryptography which relies on the computational difficulty of certain mathematical functions, and cannot provide any indication of eavesdropping or guarantee of key security. The proposal present in this work develops a quantum key distribution model to safeguard security in large networks, in the directions of classical cryptography and quantum cryptography. Two three-party Quantum key distribution are used in this model, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination. The performance of Quantum Key Distribution (QKD) systems have notably progressed since the early experimental demonstrations. The current evolutions in QKD research indicate that the pace of this progression is very likely to be maintained, if not increased, in the future years. In parallel to these improvements of QKD techniques, commercial products are also being developed, making QKD deployment a feasible alternative for securing real data networks. Deployment of a real QKD network is however far from being straightforward. It requires development of a network architecture connecting multiple users that may possibly be very far away from each other. Considering the fact that the existing QKD links are only point-to-point, and intrinsically limited in distance, deployment of a practical QKD network structure is a nontrivial problem. The proposed work describes the proposed architecture for a QKD network specify the requirements relevant to the network design, protocols, and services. The objective of this specification is to define the major components and their main features The proposal provides security against such attacks as man-in-the-middle, eavesdropping and replay. It also improves the efficiency of the quantum key distribution which contains the fewest number of communication rounds among existing Quantum key distributions. In this model two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this proposed model provides a primitive called the Unbiased-Chosen Basis (UCB) assumption with the quantum key in angular positions.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jul 1, 2010•1 citation
The main purpose of the sharing schemes based on trusted servers is to obtain a password. The threshold cryptography aims the secret cryptographic protection, and is based on the distribution of the key on several servers, with the purpose to tolerate the attacks. In this work I will present a quantum version of the password sharing protocol, using a number n of trustful servers, to assure its security. The model I propose approaches the issue of the distribution of the authentication key between a client and n-1 servers.
A theoretical scheme for multi-user quantum authentication and key distribution in a network is proposed. Similar to the authentication architecture of the netw ork in classical cryptography, a distributed client/server architecture with the shared Einstein-Podolsky-Rosen(EPR) entangled pairs between each user and his t rusted server used for the authentication and key distribution is proposed. Base d on this architecture, any-to-any multi-user quantum authentication and key dis tribution is realized. The trusted server only provides the authentication betwe en users and swaps the entanglement between the particles so as to entangle the particles of the two users who want to communicate secretly. The key generation is performed by the requesting user. Each user in a network only shares Einstein -Podolsky-Rosen entangled pairs with the trusted server and communicates with th e trusted server through the classical channel and quantum channel. Users need n ot share EPR entangled pairs with each other so that the number of EPR pairs in the network is reduced from O(n2) to O(n).
In this paper, we design an ID-based M-server quantum password-authenticated key exchange scheme, where the client computes a strong key from its password and splits the key into m portions, and then encrypts them and sends them to m servers to be used as the basis for encryption and decryption in the subsequent key exchange process. The adoption of multiple servers can effectively prevent third-party attacks on the server and ensure the security of the key information, which is just like a complex secret sharing mechanism in traditional computational cryptography, for example, secret sharing (m, n) threshold scheme, but our new quantum fusion technology to realise the secret sharing mechanism is more efficient and simpler. Finally, through analysis, our scheme can meet most of the security requirements and perform well. It is feasible to implement the protocol under the existing quantum technology.
In quantum cryptography, quantum secret sharing (QSS)(QSS)(QSS) is a fundamental primitive. QSSQSSQSS can be used to create complex and secure multiparty quantum protocols. Existing QSSQSSQSS protocols are either at the (n,n)(n, n)(n,n) threshold 222 level or at the (t,n)(t, n)(t,n) threshold ddd level with a trusted player, where nnn denotes the number of players and ttt denotes the threshold number of players. Here, we propose a secure ddd-level QSSQSSQSS protocol for sharing a secret with efficient simulation. This protocol is more secure, flexible, and practical as compared to the existing QSSQSSQSS protocols: (n,n)(n, n)(n,n) threshold 222-level and (t,n)(t,n)(t,n) threshold ddd-level with a trusted player. Further, it does not disclose any information about the secret to players. Its security analysis shows that the intercept-resend, intercept, entangle-measure, forgery, collision and collusion attacks are not possible in this protocol.
Abstract Secret sharing, as an important cryptographic technique, effectively reduces the risk of single points of failure and centralized leakage by distributing secret information across multiple independent entities. With the widespread application of cloud computing and cloud storage, achieving long-term secure storage and controllable recovery of sensitive data in untrusted cloud environments has become a critical issue. Traditional cloud storage solutions face potential risks of security degradation and privacy exposure under long-term operation and future quantum computing threats. This paper proposes a quantum secret sharing (QSS) scheme for cloud storage scenarios, combining the threshold secret sharing with quantum secure communication and quantum information processing to achieve distributed storage and secure reconstruction of secret information across multiple cloud servers. A quantum identity authentication mechanism is introduced to the authenticated user based on a quantum sequence. This protocol enhances the long-term security of the system during the storage phase through threshold distribution and proactive share refreshing mechanisms, and utilizes quantum states to complete the secure reconstruction of secrets during the recovery phase. Additionally, this scheme avoids direct interaction between cloud servers, improving the security in untrusted cloud environments. Security analysis shows that this protocol can effectively resist threats such as external eavesdropping and internal collusion.
Quantum secret sharing is an important branch of quantum cryptography, and secure multi-party quantum key distribution protocols can be constructed using quantum secret sharing. In this paper, we construct a quantum secret sharing scheme built on a constrained (t, n ) threshold access structure, where n is the number of participants and t is the threshold number of participants and the distributor. Participants from two different sets perform the corresponding phase shift operations on two particles in the GHZ state passed to them, and then t−1 participants with the distributor can recover the key, where the participant recovering the key measures the particles received by himself and finally obtains the key through the collaboration of the distributors. Security analysis shows that this protocol can be resistant to direct measurement attacks, interception retransmission attacks, and entanglement measurement attacks. This protocol is more secure, flexible, and efficient compared with similar existing protocols, which can save more quantum resources.
The security of quantum cryptography relies on the foundations of quantum mechanics, in contrast to traditional public key cryptography which relies on the computational difficulty of certain mathematical functions, and cannot provide any indication of eavesdropping or guarantee of key security. The proposal present in this work develops a quantum key distribution model to safeguard security in large networks, in the directions of classical cryptography and quantum cryptography. Two three-party Quantum key distribution are used in this model, one with implicit user authentication and the other with explicit mutual authentication, are proposed to demonstrate the merits of the new combination. The performance of Quantum Key Distribution (QKD) systems have notably progressed since the early experimental demonstrations. The current evolutions in QKD research indicate that the pace of this progression is very likely to be maintained, if not increased, in the future years. In parallel to these improvements of QKD techniques, commercial products are also being developed, making QKD deployment a feasible alternative for securing real data networks. Deployment of a real QKD network is however far from being straightforward. It requires development of a network architecture connecting multiple users that may possibly be very far away from each other. Considering the fact that the existing QKD links are only point-to-point, and intrinsically limited in distance, deployment of a practical QKD network structure is a nontrivial problem. The proposed work describes the proposed architecture for a QKD network specify the requirements relevant to the network design, protocols, and services. The objective of this specification is to define the major components and their main features The proposal provides security against such attacks as man-in-the-middle, eavesdropping and replay. It also improves the efficiency of the quantum key distribution which contains the fewest number of communication rounds among existing Quantum key distributions. In this model two parties can share and use a long-term secret (repeatedly). To prove the security of the proposed schemes, this proposed model provides a primitive called the Unbiased-Chosen Basis (UCB) assumption with the quantum key in angular positions.