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

International ISC Conference on Information Security and Cryptology (ISCISC)

A lattice-based threshold secret sharing scheme

Hamidreza Amini Khorasgani, Saba Asaad, Taraneh Eghlidos, Mohammadreza Aref

Published Sep 1, 2014• 20 citations
Publisher

Abstract

In this paper, we introduce a method of threshold secret sharing scheme in which secret reconstruction is based on celebrated Babai lattice algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there is no quantum threats to these channels. One solution for this problem can be utilization of lattice cryptosystems for these channels which requires designing lattice based secret sharing schemes. We indicate that our scheme is asymptotically correct. Moreover, we analyze the security of our scheme by giving a quantitative proof of security from the view point of information theory.

DOI
10.1109/iscisc.2014.6994043

Related papers

On the design and security of a lattice-based threshold secret sharing scheme

Hamidreza Amini Khorasgani, Saba Asaad, Hossein Pilaram +2 more

In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channels which requires designing lattice-based TSSSs. We investigate the effect of lattice dimension on the security and correctness of the proposed scheme. Moreover, we prove that for a fixed lattice dimension the proposed scheme is asymptotically correct. We also give a quantitative proof of security from information theoretic viewpoint.

Isecure.•Dec 15, 2015•1 citation

Sharing secret using lattice construction

Saba Asaad, Hamidreza Amini Khorasgani, Taraneh Eghlidos +1 more

In this paper, a variant of (t, n) threshold secret sharing scheme is realized using a lattice model. Due to the potential quantum attacks in the future, we need to construct a secure channels for transmitting secret shares. Such channels could be modeled by a lattice based public key cryptosystem whose security is based on the worst case hardness of lattice problems. Therefore, we propose a lattice based threshold secret sharing scheme that is compatible with the platform on which the cryptosystem is built. It is shown that the proposed scheme is correct and asymptotically perfect from information theoretic point of view.

International Symposium on Telecommunications•Sep 1, 2014•6 citations

Lattice-based Threshold Secret Sharing Algorithm

ZHANG Hongjun,LIU Ke,MOU Zhansheng

The secret sharing algorithm based on the traditional mathematical assumption is difficult to resist the attack of the quantum algorithm.Therefore,a lattice-based threshold secret sharing algorithm is proposed.The basic process of the secret sharing strategy is analyzed,which is divided into public key generation,share generation and secret reconstruction.The threshold secret sharing algorithm based on lattice is discussed.The algorithm can be reduced to the closest vector problem,and its security is analyzed.Calculation results prove that the algorithm is correct and safe.

•Jun 1, 2016•0 citations

QSSS-LTE: quantum secret sharing scheme over lattice-based threshold encryption

Xiuli Song, Tianai Xu, Yousheng Zhou +1 more

Abstract This paper proposed a quantum secret sharing scheme over lattice-based threshold encryption: it integrates resplittable threshold public key encryption (RTPKE) and utilizes a lattice-based private key share transmission mechanism to enhance the security of the share distribution process. By leveraging the dynamic key management features of RTPKE, the scheme can flexibly adjust key distribution as required when participants change. During the quantum secret reconstruction process, the decoy particles do not need to be detected by eavesdroppers when transmitted between participants. Instead, this task is performed by a semi-trusted third party (TP), reducing resource consumption and communication overhead. The decoy particles are not chosen from a fixed quantum bases but are instead in completely random quantum bases, making it impossible for an eavesdropper to obtain the correct result through conventional measurements. The probability of the eavesdropper escaping detection after measuring any decoy particle is nearly zero. After each participant performs a unitary operation, they randomly shuffle the sequence of decoy and information particles. When the particles are transmitted back to the TP, the TP uses the sequence information recorded by the participants to restore the original order and extract the information particles, effectively defending against forgery-replay attacks and potential threats from dishonest participants.

Quantum Science and Technology•Aug 26, 2025•0 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

Lattice-Based Threshold Secret Sharing Scheme and Its Applications: A Survey

Jingyu Chen, Haitao Deng, Huachang Su +2 more

As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.

Electronics•Jan 8, 2024•21 citations
In this paper, we introduce a method of threshold secret sharing scheme in which secret reconstruction is based on celebrated Babai lattice algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there is no quantum threats to these channels. One solution for this problem can be utilization of lattice cryptosystems for these channels which requires designing lattice based secret sharing schemes. We indicate that our scheme is asymptotically correct. Moreover, we analyze the security of our scheme by giving a quantitative proof of security from the view point of information theory.
In this paper, we introduce a method of threshold secret sharing scheme (TSSS) in which secret reconstruction is based on Babai's nearest plane algorithm. In order to supply secure public channels for transmitting shares to parties, we need to ensure that there are no quantum threats to these channels. A solution to this problem can be utilization of lattice-based cryptosystems for these channels which requires designing lattice-based TSSSs. We investigate the effect of lattice dimension on the security and correctness of the proposed scheme. Moreover, we prove that for a fixed lattice dimension the proposed scheme is asymptotically correct. We also give a quantitative proof of security from information theoretic viewpoint.
In this paper, a variant of (t, n) threshold secret sharing scheme is realized using a lattice model. Due to the potential quantum attacks in the future, we need to construct a secure channels for transmitting secret shares. Such channels could be modeled by a lattice based public key cryptosystem whose security is based on the worst case hardness of lattice problems. Therefore, we propose a lattice based threshold secret sharing scheme that is compatible with the platform on which the cryptosystem is built. It is shown that the proposed scheme is correct and asymptotically perfect from information theoretic point of view.
The secret sharing algorithm based on the traditional mathematical assumption is difficult to resist the attack of the quantum algorithm.Therefore,a lattice-based threshold secret sharing algorithm is proposed.The basic process of the secret sharing strategy is analyzed,which is divided into public key generation,share generation and secret reconstruction.The threshold secret sharing algorithm based on lattice is discussed.The algorithm can be reduced to the closest vector problem,and its security is analyzed.Calculation results prove that the algorithm is correct and safe.
Abstract This paper proposed a quantum secret sharing scheme over lattice-based threshold encryption: it integrates resplittable threshold public key encryption (RTPKE) and utilizes a lattice-based private key share transmission mechanism to enhance the security of the share distribution process. By leveraging the dynamic key management features of RTPKE, the scheme can flexibly adjust key distribution as required when participants change. During the quantum secret reconstruction process, the decoy particles do not need to be detected by eavesdroppers when transmitted between participants. Instead, this task is performed by a semi-trusted third party (TP), reducing resource consumption and communication overhead. The decoy particles are not chosen from a fixed quantum bases but are instead in completely random quantum bases, making it impossible for an eavesdropper to obtain the correct result through conventional measurements. The probability of the eavesdropper escaping detection after measuring any decoy particle is nearly zero. After each participant performs a unitary operation, they randomly shuffle the sequence of decoy and information particles. When the particles are transmitted back to the TP, the TP uses the sequence information recorded by the participants to restore the original order and extract the information particles, effectively defending against forgery-replay attacks and potential threats from dishonest participants.
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.
As the most popular cryptographic scheme in the post-quantum field, lattices have received extensive attention and research. Not only do they provide quantum-resistant security, they also enable the construction of complex applications. Currently, lattice cryptography schemes based on different difficult problems have been applied in different fields. The threshold secret sharing (TSS) scheme is an important field of cryptography and has important application value and development prospects in key protection, secure multi-party computation, privacy protection, etc. However, with the rapid development of quantum computing, many existing cryptography-underlying technologies are facing huge difficulties and challenges. Therefore, post-quantum TSS has important research significance and value for the future development of cryptography. In this paper, we summarize the existing secret sharing schemes based on lattice-hard problems and the relevant applications of these schemes in the post-quantum realm. We classify existing lattice-based TSS according to different functions and introduce typical solutions. To the best of our knowledge, this is the first review paper on lattice-based TSS schemes.