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

Sadhana

Computationally secure group ring based multi-stage secret sharing schemes

Yogesh Kumar Gupta, Gaurav Mittal, S K Pal

Published Sep 7, 2026• 0 citations
Publisher
DOI
10.1007/s12046-026-03275-6

Related papers

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

Secure schemes for secret sharing and key distribution

Amos Beimel

•Jan 1, 1996•779 citations

On the Security of a Lattice-Based Multi-Stage Secret Sharing Scheme

Zhichao Yang, Debiao He, Longjiang Qu +1 more

In response to the threat posed by quantum computers, Pilaram and Eghlidos proposed the first lattice-based multi-stage secret sharing scheme which is the only post-quantum multi-stage secret sharing scheme. In this paper, we introduce an efficient attack on it and show that any adversary can easily reconstruct unrecovered secrets as long as it collects enough pseudo-secret shares. For the sake of complete, we further list two countermeasures to protect the scheme from such attack.

IEEE Transactions on Dependable and Secure Computing•Sep 23, 2022•9 citations

An Efficient Lattice Based Multi-stage Secret Sharing Scheme

Hossein Pilaram, Taraneh Eghlidos

In this paper, we construct a lattice based (t, n) threshold multi-stage secret sharing (MSSS) scheme according to Ajtai's construction for one-way functions. In an MSSS scheme, the authorized subsets of participants can recover a subset of secrets at each stage while other secrets remain undisclosed. In this paper, each secret is a vector from a t-dimensional lattice and the basis of each lattice is kept private. A t-subset of n participants can recover the secret(s) using their assigned shares. Using a lattice based one-way function, even after some secrets are revealed, the computational security of the unrecovered secrets is provided against quantum computers. The scheme is multi-use in the sense that to share a new set of secrets, it is sufficient to renew some public information such that a new share distribution is no longer required. Furthermore, the scheme is verifiable meaning that the participants can verify the shares received from the dealer and the recovered secrets from the combiner, using public information.

IEEE Transactions on Dependable and Secure Computing•Jan 1, 2015•45 citations

Improved lattice-based multistage secret sharing scheme

R. Sreerama Kumar, Sahadeo Padhye

Sadhana•Mar 27, 2025•1 citation

Multi-linear Secret-Sharing Schemes

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

Lecture notes in computer science•Jan 1, 2014•36 citations
In this paper, we construct a lattice based (t, n) threshold multi-stage secret sharing (MSSS) scheme according to Ajtai's construction for one-way functions. In an MSSS scheme, the authorized subsets of participants can recover a subset of secrets at each stage while other secrets remain undisclosed. In this paper, each secret is a vector from a t-dimensional lattice and the basis of each lattice is kept private. A t-subset of n participants can recover the secret(s) using their assigned shares. Using a lattice based one-way function, even after some secrets are revealed, the computational security of the unrecovered secrets is provided against quantum computers. The scheme is multi-use in the sense that to share a new set of secrets, it is sufficient to renew some public information such that a new share distribution is no longer required. Furthermore, the scheme is verifiable meaning that the participants can verify the shares received from the dealer and the recovered secrets from the combiner, using public information.