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
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.