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

Lecture notes in computer science

Improved Polynomial Secret-Sharing Schemes

Amos Beimel, Oriol Farràs, Or Lasri

Published Jan 1, 2023• 5 citations
Publisher
DOI
10.1007/978-3-031-48618-0_13

Related papers

Improved lattice-based multistage secret sharing scheme

R. Sreerama Kumar, Sahadeo Padhye

Sadhana•Mar 27, 2025•1 citation

Quadratic Secret Sharing and Conditional Disclosure of Secrets

Amos Beimel, Hussien Othman, Naty Peter

There is a huge gap between the upper and lower bounds on the share size of secret-sharing schemes for$n$-party access structures; consistent with our current knowledge the optimal share size can be anywhere between polynomial and exponential in$n$. For linear secret-sharing schemes, the share size for almost all$n$-party access structures is exponential in$n$. We would like to study larger classes of secret-sharing schemes with two goals: 1) prove lower bounds for larger classes of secret-sharing schemes; and 2) construct efficient secret-sharing schemes. Given this motivation, Paskin-Cherniavsky and Radune (ITC’20) introduced a new class of secret-sharing schemes in which the shares are generated by applying degree-$d$polynomials to the secret and some random field elements. We define and study two additional classes of polynomial secret-sharing schemes: 1) schemes in which the reconstruction of the secret is done using polynomials; and 2) schemes in which both sharing and reconstruction are done by polynomials. Our main result is a construction of secret-sharing schemes and conditional disclosure of secrets protocols with quadratic sharing and reconstruction that are more efficient than linear secret-sharing schemes. To complement our results, we prove lower bounds on the share size for schemes with polynomial reconstruction. Finally, we give an evidence that schemes with polynomial sharing are probably stronger than schemes with polynomial reconstruction.

IEEE Transactions on Information Theory•Jul 18, 2023•3 citations

Strongly ideal secret sharing schemes

Steven J. Phillips, Nicholas C. K. Phillips

Journal of Cryptology•Oct 1, 1992•16 citations

Multi-linear Secret-Sharing Schemes

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

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

Cryptanalysis and improvement of fair quantum secret sharing based on symmetric bivariate polynomial

Jiebin Gu, Feixiang Li, Shixin Zhu

Abstract As a fundamental component of quantum cryptography, quantum secret sharing (SS) faces a critical security challenge: dishonest participants may gain exclusive access to the shared secret through deceptive actions. To address this, recent advances in fair quantum SS have emerged, allowing equitable secret access among all participants. However, our analysis reveals security vulnerabilities in Bai et al ’s fair quantum SS scheme (Physica A, 2022). First, we show that Bai et al ’s scheme is vulnerable to collusion attack by m − 1 dishonest participants when m − 1 ⩾ t , where t is the threshold value. Second, we point that Bai et al ’s scheme is insecure under our defined attack model—the latent attack. In this work, a possible improved scheme is proposed to overcome the security flaws and halve the computational cost.

Journal of Physics A Mathematical and Theoretical•Oct 29, 2025•1 citation

Simplified PIR and CDS Protocols and Improved Linear Secret-Sharing Schemes

Bar Alon, Amos Beimel, Or Lasri

Lecture notes in computer science•Dec 1, 2025•4 citations
There is a huge gap between the upper and lower bounds on the share size of secret-sharing schemes fornnn-party access structures; consistent with our current knowledge the optimal share size can be anywhere between polynomial and exponential innnn. For linear secret-sharing schemes, the share size for almost allnnn-party access structures is exponential innnn. We would like to study larger classes of secret-sharing schemes with two goals: 1) prove lower bounds for larger classes of secret-sharing schemes; and 2) construct efficient secret-sharing schemes. Given this motivation, Paskin-Cherniavsky and Radune (ITC’20) introduced a new class of secret-sharing schemes in which the shares are generated by applying degree-dddpolynomials to the secret and some random field elements. We define and study two additional classes of polynomial secret-sharing schemes: 1) schemes in which the reconstruction of the secret is done using polynomials; and 2) schemes in which both sharing and reconstruction are done by polynomials. Our main result is a construction of secret-sharing schemes and conditional disclosure of secrets protocols with quadratic sharing and reconstruction that are more efficient than linear secret-sharing schemes. To complement our results, we prove lower bounds on the share size for schemes with polynomial reconstruction. Finally, we give an evidence that schemes with polynomial sharing are probably stronger than schemes with polynomial reconstruction.
Abstract As a fundamental component of quantum cryptography, quantum secret sharing (SS) faces a critical security challenge: dishonest participants may gain exclusive access to the shared secret through deceptive actions. To address this, recent advances in fair quantum SS have emerged, allowing equitable secret access among all participants. However, our analysis reveals security vulnerabilities in Bai et al ’s fair quantum SS scheme (Physica A, 2022). First, we show that Bai et al ’s scheme is vulnerable to collusion attack by m − 1 dishonest participants when m − 1 ⩾ t , where t is the threshold value. Second, we point that Bai et al ’s scheme is insecure under our defined attack model—the latent attack. In this work, a possible improved scheme is proposed to overcome the security flaws and halve the computational cost.