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 Conference on Computational Intelligence and Communication Networks (CICN)

Error Injected ($\mathrm{t}, \mathrm{n}$) Threshold Secrecy Having Probable Quantum Resilience

Anindya Kumar Biswas, Bikram Basak, Dinesh Kumar Bagla

Published Dec 20, 2025• 0 citations
Publisher

Abstract

This paper shows how to share and protect secret information using smart and safe math. We built a system that keeps secrets even when future quantum computers become powerful. First, we used a technique called Learning With Error (LWE) to create a secret. LWE adds small amounts of noise to make it hard to guess, even with very strong computers. Next, we spilt the secret into parts using a math formula called a polynomial. These parts, called shares, were given to different people. The secret could only be rebuilt if enough people at least a chosen threshold worked together. In our test, 7 out of 11 people were needed. To make sure everyone's share was real and not fake, we add something that called a commitment. This let people prove their share was valid without showing the secret. We used Lagrange interpolation, a math trick, to combine the shares and get the secret back. We also rebuilt the original polynomial that made the shares. We checked how random the values were (called entropy), and the results showed strong security. All steps worked smoothly. This proves our system is secure, accurate, and ready to protect secrets even in the age of quantum computing.

DOI
10.1109/cicn67655.2025.11368138

Related papers

Quantum secret sharing via lagrange interpolation: from static to conditional dynamic threshold

Kuo-Chun Tseng, Wei-Lin Lee, Chi‐Yuan Chen +1 more

Abstract With the rapid development of quantum computing, traditional encryption methods face growing security threats. Quantum Secret Sharing (QSS) has emerged as a promising solution, using quantum principles to improve communication security and prevent internal and external attacks. This study proposes a new (t, n) Threshold Quantum Secret Sharing (TQSS) protocol based on single-qubit unitary operations and Lagrange interpolation. The protocol allows secret reconstruction without third-party or dealer assistance and remains efficient even when some participants are absent. To address more complex real-world scenarios, we extend our previously proposed (t, n) TQSS protocol into a Conditional Dynamic TQSS (CDTQSS). This approach uses resource-based share splitting to allow new participants to join without requiring the dealer to redistribute information. However, the protocol is ‘conditional’ because existing participants must take on extra responsibility-they must assist in generating shares for new members and also participate in the secret reconstruction process together with them. The protocol maintains strong security, reduces resource consumption, and offers better flexibility, making it well-suited for practical and dynamic quantum communication needs.

Physica Scripta•Jun 9, 2025•3 citations

A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method

Manoj Kumar M

Verifiable secret sharing schemes are important in cloud computing environments. Thus a key can be distributed over many servers by threshold secret sharing mechanism. The key is then reconstructed when needed. Secret sharing has also been suggested for sensor networks where the links are liable to be tapped by sending the data in shares which makes the task of the eavesdropper harder. The security in such environments can be made greater by continuous changing of the way the shares are constructed. In the present paper we proposed a verifiable quantum -threshold secret sharing scheme using Lagrange interpolation and two qudit Bell state in -dimensional Hilbert space. As discussed in the second last section of this paper, the proposed scheme is enough secure against the fraud in secret share distribution phase as well as secret reconstruction phase.

International Journal of Advanced Research in Computer Science and Software Engineering•Jul 29, 2017•1 citation

A flexible framework for (n,n) quantum secret sharing

Kuo-Chun Tseng, Wei-Lin Lee, Chi‐Yuan Chen +1 more

With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.

Modern Physics Letters A•Jul 4, 2025•1 citation

Provably Secure LWE Encryption with Smallish Uniform Noise and Secret

Daniel Cabarcas, Florian Göpfert, Patrick Weiden

Abstract. In this paper we propose the first provably secure public key encryption scheme based on the Learning with Errors (LWE) problem, in which secrets and errors are sampled uniformly at random from a relatively small set rather than from the commonly used discrete Gaussian distribution. Using a uniform distribution, instead of a Gaussian, has the potential of improving computational efficiency a great deal due to its simplicity, thus making the scheme attractive for use in practice. At the same time our scheme features the strong security guarantee of being based on the hardness of worst-case lattice problems. After presenting the construction of our scheme we prove its security and propose asymptotic parameters. Finally, we compare our scheme on several measures to one of the most efficient LWE-based encryption schemes with Gaussian noise. We show that the expected efficiency improvement is debunked, due to the large blow-up of the parameter sets involved.

•Jan 1, 2014•2 citations

Hidden-State Proofs of Quantumness

Carl A. Miller

An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed by an efficient quantum prover, but one that can be passed by a prover that exhibits a certain amount of computational error. (Brakerski et al. 2018) introduced an innovative two-round proof of quantumness based on the Learning With Errors (LWE) assumption. However, one of the steps in their protocol (the pre-image test) has low tolerance for error. In this work we present a proof of quantumness which maintains the same circuit structure as (Brakerski et al. 2018) while improving the robustness for noise. Our protocol is based on cryptographically hiding an extended Greenberger-Horne-Zeilinger (GHZ) state within a sequence of classical bits. Asymptotically, our protocol allows the total probability of error within the circuit to be as high as $1 - O ( λ^{-C} )$, where $λ$ is the security parameter and $C$ is a constant that can be made arbitrarily large. As part of the proof of this result, we also prove an uncertainty principle over finite abelian groups which may be of independent interest.

arXiv:2410.06368•Oct 8, 2024•4 citations

Enhancing Data Security in Transmission Through Quantum Key Distribution in Cryptography

Sulakshana Sagar Malwade, Shilpa Choudhary, Santosh H. Lavate +3 more

As the world becomes more computerized, keeping data transfer safe has become very important. Quantum computers and other strong computers have the ability to break classical encryption methods, even though they are widely used. Quantum Key Distribution (QKD) is a new way to protect data. It uses quantum physics to make sure that the sharing of cryptographic keys is safe. The aim of this study is to look into how QKD can be used to improve the security of data transfer. The suggested method combines QKD with current encryption standards to create a safe and effective way to send data. The method includes setting up a key sharing system based on QKD and then using symmetric encryption algorithms to keep the data being sent safe. The system is tried in different communication settings to see how well it protects against spying and "man-in-the-middle" attacks. The study's results show that QKD greatly improves the safety of sending data by keeping the cryptography keys secret. The results show that QKD has the potential to stop people from getting in without permission and find any attempts to change the keys while they are being sent out. The table below shows performance numbers that show how well QKD works in real-world situations. It shows how well communication speeds and security measures compare.

International Conference on Emerging Smart Computing and Informatics (ESCI)•Mar 5, 2025•4 citations
Error Injected (t,n\mathrm{t}, \mathrm{n}t,n) Threshold Secrecy Having Probable Quantum Resilience
This paper shows how to share and protect secret information using smart and safe math. We built a system that keeps secrets even when future quantum computers become powerful. First, we used a technique called Learning With Error (LWE) to create a secret. LWE adds small amounts of noise to make it hard to guess, even with very strong computers. Next, we spilt the secret into parts using a math formula called a polynomial. These parts, called shares, were given to different people. The secret could only be rebuilt if enough people at least a chosen threshold worked together. In our test, 7 out of 11 people were needed. To make sure everyone's share was real and not fake, we add something that called a commitment. This let people prove their share was valid without showing the secret. We used Lagrange interpolation, a math trick, to combine the shares and get the secret back. We also rebuilt the original polynomial that made the shares. We checked how random the values were (called entropy), and the results showed strong security. All steps worked smoothly. This proves our system is secure, accurate, and ready to protect secrets even in the age of quantum computing.
Abstract With the rapid development of quantum computing, traditional encryption methods face growing security threats. Quantum Secret Sharing (QSS) has emerged as a promising solution, using quantum principles to improve communication security and prevent internal and external attacks. This study proposes a new (t, n) Threshold Quantum Secret Sharing (TQSS) protocol based on single-qubit unitary operations and Lagrange interpolation. The protocol allows secret reconstruction without third-party or dealer assistance and remains efficient even when some participants are absent. To address more complex real-world scenarios, we extend our previously proposed (t, n) TQSS protocol into a Conditional Dynamic TQSS (CDTQSS). This approach uses resource-based share splitting to allow new participants to join without requiring the dealer to redistribute information. However, the protocol is ‘conditional’ because existing participants must take on extra responsibility-they must assist in generating shares for new members and also participate in the secret reconstruction process together with them. The protocol maintains strong security, reduces resource consumption, and offers better flexibility, making it well-suited for practical and dynamic quantum communication needs.
Verifiable secret sharing schemes are important in cloud computing environments. Thus a key can be distributed over many servers by threshold secret sharing mechanism. The key is then reconstructed when needed. Secret sharing has also been suggested for sensor networks where the links are liable to be tapped by sending the data in shares which makes the task of the eavesdropper harder. The security in such environments can be made greater by continuous changing of the way the shares are constructed. In the present paper we proposed a verifiable quantum -threshold secret sharing scheme using Lagrange interpolation and two qudit Bell state in -dimensional Hilbert space. As discussed in the second last section of this paper, the proposed scheme is enough secure against the fraud in secret share distribution phase as well as secret reconstruction phase.
With the rise of quantum computing, traditional cryptography is facing serious threats. Secret sharing, as an important primitive of cryptography, is also affected. Because secret sharing is widely used in many fields, researchers have started to explore quantum secret sharing (QSS). QSS uses basic principles of quantum mechanics to provide strong security and can protect against both eavesdropping and malicious attacks. However, most existing QSS studies focus on specific situations and lack the flexibility needed for complex multiparty environments. In this work, we propose a general QSS framework that can be applied to different scenarios. We first design a basic [Formula: see text] QSS protocol, and then extend it to support multiparty communication and dynamic changes in participants. Our security analysis shows that the proposed method keeps strong security, uses fewer resources, and works independently without the need for a trusted third party (TP). This protocol offers a unified solution that can meet different application needs and provides a new approach to handling diverse QSS tasks more efficiently.
Abstract. In this paper we propose the first provably secure public key encryption scheme based on the Learning with Errors (LWE) problem, in which secrets and errors are sampled uniformly at random from a relatively small set rather than from the commonly used discrete Gaussian distribution. Using a uniform distribution, instead of a Gaussian, has the potential of improving computational efficiency a great deal due to its simplicity, thus making the scheme attractive for use in practice. At the same time our scheme features the strong security guarantee of being based on the hardness of worst-case lattice problems. After presenting the construction of our scheme we prove its security and propose asymptotic parameters. Finally, we compare our scheme on several measures to one of the most efficient LWE-based encryption schemes with Gaussian noise. We show that the expected efficiency improvement is debunked, due to the large blow-up of the parameter sets involved.
An experimental cryptographic proof of quantumness will be a vital milestone in the progress of quantum information science. Error tolerance is a persistent challenge for implementing such tests: we need a test that not only can be passed by an efficient quantum prover, but one that can be passed by a prover that exhibits a certain amount of computational error. (Brakerski et al. 2018) introduced an innovative two-round proof of quantumness based on the Learning With Errors (LWE) assumption. However, one of the steps in their protocol (the pre-image test) has low tolerance for error. In this work we present a proof of quantumness which maintains the same circuit structure as (Brakerski et al. 2018) while improving the robustness for noise. Our protocol is based on cryptographically hiding an extended Greenberger-Horne-Zeilinger (GHZ) state within a sequence of classical bits. Asymptotically, our protocol allows the total probability of error within the circuit to be as high as 1−O(λ−C)1 - O ( λ^{-C} )1−O(λ−C), where λλλ is the security parameter and CCC is a constant that can be made arbitrarily large. As part of the proof of this result, we also prove an uncertainty principle over finite abelian groups which may be of independent interest.
As the world becomes more computerized, keeping data transfer safe has become very important. Quantum computers and other strong computers have the ability to break classical encryption methods, even though they are widely used. Quantum Key Distribution (QKD) is a new way to protect data. It uses quantum physics to make sure that the sharing of cryptographic keys is safe. The aim of this study is to look into how QKD can be used to improve the security of data transfer. The suggested method combines QKD with current encryption standards to create a safe and effective way to send data. The method includes setting up a key sharing system based on QKD and then using symmetric encryption algorithms to keep the data being sent safe. The system is tried in different communication settings to see how well it protects against spying and "man-in-the-middle" attacks. The study's results show that QKD greatly improves the safety of sending data by keeping the cryptography keys secret. The results show that QKD has the potential to stop people from getting in without permission and find any attempts to change the keys while they are being sent out. The table below shows performance numbers that show how well QKD works in real-world situations. It shows how well communication speeds and security measures compare.