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

Multi-linear Secret-Sharing Schemes

Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin

Published Jan 1, 2014• 36 citations
Publisher
DOI
10.1007/978-3-642-54242-8_17

Related papers

Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes

Zhifang Zhang, Mulan Liu, Liangliang Xiao

Lecture notes in computer science•Jan 1, 2005•4 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

General Secure Multi-party Computation from any Linear Secret-Sharing Scheme

Ronald Cramer, Ivan Damgård, Ueli M. Maurer

Lecture notes in computer science•Jan 1, 2000•548 citations

Secret Sharing Schemes and Secure Multi-party Computation

Mulan Liu

In the paper, through a complete description of secret sharing schemes, we give definitions respectively for perfect secret sharing schemes, statistical secret sharing schemes and computational secret sharing schemes in an uniform way. Furthermore, we analyze why and how multiplicative linear secret sharing schemes are used in secure multi-party computation protocols, and explain the security of secure multi-party computation in detail.

Journal of Beijing Electronic Science and Technology Institute•Jan 1, 2006•4 citations

Ideal Secret Sharing Schemes with Multiple Secrets

Wen‐Ai Jackson, Keith M. Martin, Christine M. O’Keefe

Journal of Cryptology•Jan 1, 1996•42 citations

Post-quantum Multi-stage Secret Sharing Schemes using Inhomogeneous Linear Recursion and Ajtai's Function

Jing Yang, Fang‐Wei Fu

Secret sharing was firstly proposed in 1979 by Shamir and Blakley respectively. To avoid deficiencies of original schemes, researchers presented improvement schemes, among which the multi-secret sharing scheme (MSS) is significant. There are three categories of MSSs, however, we focus on multi-stage secret sharing scheme (MSSS) recovering secrets with any order in this work. By observing inhomogeneous linear recursions (ILRs) in the literature, we conclude a general formula and divide ILRs into two types according to different variables in them. Utilizing these two kinds of ILRs, we propose four verifiable MSSSs with Ajtai's function, which is a lattice-based function. Our schemes have the following advantages. Firstly, our schemes can detect cheat of the dealer and participants, and are multi-use. Secondly, we have several ways to restore secrets. Thirdly, we can turn our schemes into other types of MSSs due to the universality of our method. Fourthly, since we utilize a lattice-based function to mask shares, our schemes can resist the attack from the quantum computer with computational security. Finally, although our schemes need more memory consumption than some known schemes, we need much less time consumption, which makes our schemes more suitable facing limited computing power.

arXiv:2202.09026•Feb 18, 2022•0 citations
Secret sharing was firstly proposed in 1979 by Shamir and Blakley respectively. To avoid deficiencies of original schemes, researchers presented improvement schemes, among which the multi-secret sharing scheme (MSS) is significant. There are three categories of MSSs, however, we focus on multi-stage secret sharing scheme (MSSS) recovering secrets with any order in this work. By observing inhomogeneous linear recursions (ILRs) in the literature, we conclude a general formula and divide ILRs into two types according to different variables in them. Utilizing these two kinds of ILRs, we propose four verifiable MSSSs with Ajtai's function, which is a lattice-based function. Our schemes have the following advantages. Firstly, our schemes can detect cheat of the dealer and participants, and are multi-use. Secondly, we have several ways to restore secrets. Thirdly, we can turn our schemes into other types of MSSs due to the universality of our method. Fourthly, since we utilize a lattice-based function to mask shares, our schemes can resist the attack from the quantum computer with computational security. Finally, although our schemes need more memory consumption than some known schemes, we need much less time consumption, which makes our schemes more suitable facing limited computing power.