Authenticated quantum secret sharing with quantum dialogue based on Bell states

Abulkasim, Hussein; Hamad, Safwat; Bahnasy, Khalid El; Rida, S. Z.

doi:10.1088/0031-8949/91/8/085101

Cited by 39 publications

(18 citation statements)

References 62 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Classical secret sharing (CSS) [1,2] is a method for splitting and sharing a secret message amongst n number of agents in a group, where each agent holds a share of the message. Only sufficient number of agents (let us say k) can reconstruct the secret message, while any set of k-1 or lesser number of agents can gain no information about the message.…”

Section: Introductionmentioning

confidence: 99%

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

Joy

Sabir

Behera

et al. 2019

Quantum Inf Process

View full text Add to dashboard Cite

Quantum secret sharing is a way to share secret messages amongst a number of clients in a group with unconditional security. For the first time, Hillery et al. [Phys. Rev. A 59, 1829] proposed the quantum version of classical secret sharing protocol using GHZ states. Here, we implement this quantum secret sharing protocol in IBM 5-qubit quantum processor 'ibmqx4' and compare the experimentally obtained results with the theoretically predicted ones. The results are analyzed through quantum state tomography technique and the fidelity of these states were calculated for different number of executions made in the device. It is concluded that the experimental results match with the theoretical values with a high fidelity.

show abstract

Section: Introductionmentioning

confidence: 99%

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

Joy

Sabir

Behera

et al. 2019

Quantum Inf Process

View full text Add to dashboard Cite

show abstract

“…Several excellent researchers recently propose studies 41 – 44 about an internal attack on a multi-party quantum secret sharing protocol and their strategy to protect against it. The scenario of this kind of internal attack, as discussed in studies 41 – 44 , does not happen in our protocol, because the dealer distributes the parts of secrets to each participant individually by a secure quantum channel, such as QKD, and the participants do not need to distribute or forward information with each other. Once the distribution is finished, the dealer has no more information (nothing is left for stealing) and also does not need to anticipate the reconstruction process of the secret.…”

Section: Resultsmentioning

confidence: 99%

Multiparty weighted threshold quantum secret sharing based on the Chinese remainder theorem to share quantum information

Chou

Zeng

Chen

et al. 2021

Sci Rep

View full text Add to dashboard Cite

Secret sharing is a widely-used security protocol and cryptographic primitive in which all people cooperate to restore encrypted information. The characteristics of a quantum field guarantee the security of information; therefore, many researchers are interested in quantum cryptography and quantum secret sharing (QSS) is an important research topic. However, most traditional QSS methods are complex and difficult to implement. In addition, most traditional QSS schemes share classical information, not quantum information which makes them inefficient to transfer and share information. In a weighted threshold QSS method, each participant has each own weight, but assigning weights usually costs multiple quantum states. Quantum state consumption will therefore increase with the weight. It is inefficient and difficult, and therefore not able to successfully build a suitable agreement. The proposed method is the first attempt to build multiparty weighted threshold QSS method using single quantum particles combine with the Chinese remainder theorem (CRT) and phase shift operation. The proposed scheme allows each participant has its own weight and the dealer can encode a quantum state with the phase shift operation. The dividing and recovery characteristics of CRT offer a simple approach to distribute partial keys. The reversibility of phase shift operation can encode and decode the secret. The proposed weighted threshold QSS scheme presents the security analysis of external attacks and internal attacks. Furthermore, the efficiency analysis shows that our method is more efficient, flexible, and simpler to implement than traditional methods.

show abstract

“…Quantum secret sharing (QSS) schemes are also modified to design schemes for QIA enabling authentication of the legitimate users individually or simultaneously by a set of other users or trusted third party [96]. In addition, a set of schemes for QSS with the feature of identity authentication for better security have been proposed [66,[97][98][99]. A large variety of quantum resources and operations (e.g., Bell state, phase-shift operation, GHZ state) have been used in these schemes.…”

Section: Protocols Based On Quantum Secret Sharingmentioning

confidence: 99%

A short review on quantum identity authentication protocols: How would Bob know that he is talking with Alice?

Dutta¹,

Pathak²

2021

Preprint

View full text Add to dashboard Cite

Secure communication has achieved a new dimension with the advent of the schemes of quantum key distribution (QKD) as in contrast to classical cryptography, quantum cryptography can provide unconditional security. However, a successful implementation of a scheme of QKD requires identity authentication as a prerequisite. A security loophole in the identity authentication scheme may lead to the vulnerability of the entire secure communication scheme. Consequently, identity authentication is extremely important and in the last three decades several schemes for identity authentication, using quantum resources have been proposed. The chronological development of these protocols, which are now referred to as quantum identity authentication (QIA) protocols, are briefly reviewed here with specific attention to the causal connection involved in their development. The existing protocols are classified on the basis of the required quantum resources and their relative merits and demerits are analyzed. Further, in the process of the classification of the protocols for QIA, it's observed that the existing protocols can also be classified in a few groups based on the [inherent computational tasks used to design the protocols. Realization of these symmetries has led to the possibility of designing a set of new protocols for quantum identity authentication, which are based on the existing schemes of the secure computational and communication tasks. The security of such protocols is also critically analyzed.

show abstract

Authenticated quantum secret sharing with quantum dialogue based on Bell states

Cited by 39 publications

References 62 publications

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

Implementation of quantum secret sharing and quantum binary voting protocol in the IBM quantum computer

Multiparty weighted threshold quantum secret sharing based on the Chinese remainder theorem to share quantum information

A short review on quantum identity authentication protocols: How would Bob know that he is talking with Alice?

Contact Info

Product

Resources

About