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

Verifiable quantum secret sharing with multi access structures

Samaneh Mashhadi

Published Sep 5, 2022• 17 citations
Publisher
DOI
10.1016/j.ijleo.2022.169896

Related papers

Quantum secret sharing for a general quantum access structure

Chen‐Ming Bai, Zhihui Li, Meng-Meng Si +1 more

The European Physical Journal D•Oct 1, 2017•16 citations

Authenticable dynamic quantum secret sharing with hierarchical access structure

Nancy Mittal, Deepa Rathi, Sanjeev Kumar

Quantum Information Processing•Dec 1, 2025•1 citation

Dynamic hierarchical quantum secret sharing with general access structure

Feixiang Li, Tingyan Chen, Huihui Zhu +2 more

Quantum Information Processing•Aug 22, 2023•17 citations

Quantum secret sharing for general access structures based on multiparticle entanglements

Ming‐Ming Wang, Xiu‐Bo Chen, Yixian Yang

Quantum Information Processing•Nov 4, 2013•20 citations

The quantum secret sharing schemes based on hyperstar access structures

Lei Li, Zhi Li

Information Sciences•Jan 26, 2024•7 citations

On the Complexity of Verifiable Secret Sharing and Multi-Party Computation.

Ronald Cramer, Ivan Damgård, Stefan Dziembowski

We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels between players and a broadcast channel is given, and where an active, adaptive adversary can corrupt any set of players not in the access structure. In particular, we consider the complexity of protocols for this problem, as a function of the access structure and the number of players. For all access structures where VSS is possible at all, we show that, up to a polynomial time black-box reduction, the complexity of adaptively secure VSS is the same as that of ordinary secret sharing (SS), where security is only required against a passive, static adversary. Previously, such a connection was only known for linear secret sharing and VSS schemes. We then show an impossibility result indicating that a similar equivalence does not hold for Multiparty Computation (MPC): we show that even if protocols are given blac...

•Jan 1, 2000•4 citations
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels between players and a broadcast channel is given, and where an active, adaptive adversary can corrupt any set of players not in the access structure. In particular, we consider the complexity of protocols for this problem, as a function of the access structure and the number of players. For all access structures where VSS is possible at all, we show that, up to a polynomial time black-box reduction, the complexity of adaptively secure VSS is the same as that of ordinary secret sharing (SS), where security is only required against a passive, static adversary. Previously, such a connection was only known for linear secret sharing and VSS schemes. We then show an impossibility result indicating that a similar equivalence does not hold for Multiparty Computation (MPC): we show that even if protocols are given blac...