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

Theoretical Computer Science

Fully dynamic secret sharing schemes

Carlo Blundo, Antonella Cresti, Alfredo De Santis, Ugo Vaccaro

Published Oct 1, 1996• 45 citations
Publisher
DOI
10.1016/0304-3975(96)00003-5

Related papers

Fully Secure Secret-sharing Schemes Using Indistinguishability Obfuscation

Hui Min Zhao, Kouichi Sakurai

IEICE Technical Report; IEICE Tech. Rep.•Jul 7, 2016•0 citations

Multi-Secret Sharing Schemes

Carlo Blundo, Alfredo De Santis, Giovanni Di Crescenzo +2 more

Lecture notes in computer science•Jan 1, 1994•104 citations

Quantum strongly secure ramp secret sharing

Paul Zhang, 隆太郎 松本, Ryutaroh Matsumoto

Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an insufficient number of shares are put together however, no information about the secret can be revealed. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an unqualified set, that cannot fully reconstruct the secret. By allowing this, the size of a share can be drastically reduced. This paper introduces a quantum analog of classical strong security in ramp secret sharing schemes. While the ramp secret sharing scheme still leaks partial information about the secret to unqualified sets of participants, the strong security condition ensures that qudits with critical information can no longer be leaked.

•Jan 1, 2015•6 citations

Multi-linear Secret-Sharing Schemes

Amos Beimel, Aner Ben-Efraim, Carles Padró +1 more

Lecture notes in computer science•Jan 1, 2014•35 citations

Communication-Optimal Proactive Secret Sharing for Dynamic Groups.

Joshua Baron, Karim El Defrawy, Joshua Lampkins +1 more

Proactive secret sharing (PSS) schemes are designed for settings where long-term con-dentiality of secrets has to be guaranteed, specically, when all participating parties may eventually be corrupted. PSS schemes periodically refresh secrets and reset corrupted parties to an uncorrupted state; in PSS the corruption threshold t is replaced with a corruption rate which cannot be violated. In dynamic proactive secret sharing (DPSS) the number of parties can vary during the course of execution. DPSS is ideal when the set of participating parties changes over the lifetime of the secret or where removal of parties is necessary if they become severely corrupted. This paper presents the rst DPSS schemes with optimal amortized, O(1), per-secret communication compared to O(n4) or exp(n) in number of parties, n, required by existing schemes. We present perfectly and statistically secure schemes with near-optimal threshold in each case. We also describe how to construct a communication-ecient dynamic proactively-secure multiparty computation (DPMPC) protocol which achieves the same thresholds.

•Jan 1, 2015•0 citations

Anonymous secret sharing schemes

Carlo Blundo, Doug R. Stinson

Discrete Applied Mathematics•Jun 1, 1997•34 citations
Quantum secret sharing is a scheme for encoding a quantum state (the secret) into multiple shares and distributing them among several participants. If a sufficient number of shares are put together, then the secret can be fully reconstructed. If an insufficient number of shares are put together however, no information about the secret can be revealed. In quantum ramp secret sharing, partial information about the secret is allowed to leak to a set of participants, called an unqualified set, that cannot fully reconstruct the secret. By allowing this, the size of a share can be drastically reduced. This paper introduces a quantum analog of classical strong security in ramp secret sharing schemes. While the ramp secret sharing scheme still leaks partial information about the secret to unqualified sets of participants, the strong security condition ensures that qudits with critical information can no longer be leaked.
Proactive secret sharing (PSS) schemes are designed for settings where long-term con-dentiality of secrets has to be guaranteed, specically, when all participating parties may eventually be corrupted. PSS schemes periodically refresh secrets and reset corrupted parties to an uncorrupted state; in PSS the corruption threshold t is replaced with a corruption rate which cannot be violated. In dynamic proactive secret sharing (DPSS) the number of parties can vary during the course of execution. DPSS is ideal when the set of participating parties changes over the lifetime of the secret or where removal of parties is necessary if they become severely corrupted. This paper presents the rst DPSS schemes with optimal amortized, O(1), per-secret communication compared to O(n4) or exp(n) in number of parties, n, required by existing schemes. We present perfectly and statistically secure schemes with near-optimal threshold in each case. We also describe how to construct a communication-ecient dynamic proactively-secure multiparty computation (DPMPC) protocol which achieves the same thresholds.