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

IEICE Technical Report; IEICE Tech. Rep.

Cheater Identifiable Quantum Secret Sharing Schemes

Yumiko Murakami, Masaki Nakanishi, Shigeru Yamashita, Katsumasa Watanabe

Published Jul 15, 2005• 0 citations
OpenAlex

Related papers

Cheating identifiable (k, n) threshold quantum secret sharing scheme

Chenhong Yan, Zhihui Li, Lu Liu +1 more

Quantum Information Processing•Dec 23, 2021•25 citations

A new quantum secret sharing scheme

Xu Shengwei

Journal of Shandong University•Jan 1, 2016•0 citations

A verifiable (t,n) threshold quantum secret sharing scheme based on asymmetric binary polynomial

Feiting Guan, Jiansheng Guo, Lele Li

Abstract Threshold quantum secret sharing is a typical method for quantum secret sharing (QSS) schemes. In this paper, we propose a verifiable t , n threshold QSS scheme based on the d -dimensional Bell state and asymmetric binary polynomial. In this scheme, the dealer encodes the secret using the asymmetric binary polynomial and generates the corresponding secret share for each participant. Then, the dealer prepares the d -dimensional Bell state, and the participants perform corresponding unitary operations on the particles in transmission to recover the secret. With the hash function and the session key pairs, not only the cheating behavior of the dishonest participants can be detected, but also the specific cheaters can be identified. Furthermore, we consider the case when no less than t participants cooperate to recover the secret, which makes the proposed scheme more practical. Analyses show that the scheme can resist forgery attack, collusion attack and other common attacks.

Laser Physics•Oct 31, 2023•5 citations

A perfect threshold secret sharing scheme to identify cheaters

Marco Carpentieri

Designs Codes and Cryptography•May 1, 1995•69 citations

Quantum Secret Sharing

Ri‐Gui Zhou, Xiaoxue Zhang, Lin-Tao Du

Springer eBooks•Jan 1, 2024•3 citations

Can Smolin states alone lead to secure quantum secret sharing

Guang Ping He, Z. D. Wang, Yan-Kui Bai

It was indicated [Phys. Rev. A 75, 066301 (2007)] that a previous proposed quantum secret sharing (QSS) protocol based on Smolin states [Phys. Rev. A 73, 012318 (2006)] is insecure against an internal cheater. Here we build a new QSS protocol with Smolin states alone, and proved it to be secure against any cheating strategy. Thus we conclude that Smolin states alone can lead to secure QSS. We also propose a feasible scheme to implement the protocol experimentally.

•Nov 28, 2007•0 citations
Abstract Threshold quantum secret sharing is a typical method for quantum secret sharing (QSS) schemes. In this paper, we propose a verifiable t , n threshold QSS scheme based on the d -dimensional Bell state and asymmetric binary polynomial. In this scheme, the dealer encodes the secret using the asymmetric binary polynomial and generates the corresponding secret share for each participant. Then, the dealer prepares the d -dimensional Bell state, and the participants perform corresponding unitary operations on the particles in transmission to recover the secret. With the hash function and the session key pairs, not only the cheating behavior of the dishonest participants can be detected, but also the specific cheaters can be identified. Furthermore, we consider the case when no less than t participants cooperate to recover the secret, which makes the proposed scheme more practical. Analyses show that the scheme can resist forgery attack, collusion attack and other common attacks.