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

On Multiplicative Linear Secret Sharing Schemes

Ventzislav Nikov, Svetla Nikova⋆, Bart Preneel A

Published Jan 1, 2003• 9 citations
Publisher
DOI
10.1007/978-3-540-24582-7_10

Related papers

Linear multi-secret sharing schemes

Liangliang Xiao

Science in China Series F Information Sciences•Jan 1, 2005•11 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

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

On the Local Leakage Resilience of Linear Secret Sharing Schemes

Fabrice Benhamouda, Akshay Degwekar, Yuval Ishai +1 more

Journal of Cryptology•Feb 9, 2021•35 citations

Simultaneous Multiplication Protocol Based on Packed Linear Secret Sharing and Its Applications

Shohei Mita, Kazuki Yoneyama

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