A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method

Manoj Kumar


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.

Full Text:



Aigner M. and Ziegler G. M., Proofs from the Book, Springer, Berlin, 2006, pp. 7-10.

Blakley G. R., Safeguarding cryptographic keys, In Proc. of AFIPS National Computer Conference, New York, 48:313-317, 1979.

Cai Q. Y. and Li W. B., Deterministic secure communication without using entanglement, Chin. Phys. Lett. 21 (2004) 601-603.

Chen R. K., Zhang Y. Y., Shi J. H. and Li F. G., A multiparty error-correcting method for quantum secret sharing, Quantum Inf. Process, 13 (2014), 21-31.

Chor B., Goldwasser S., Micali S. and Awerbuch B., Verifiable secret sharing and achieving simultaneity in the presence of faults, In: Proceedings of 26th IEEE Symposium on Foundations of Computer Science, pp. 383-395 (1985).

Deng F. G. and Long G. L., Secure direct communication with a quantum one-time pad, Phys. Rev. A 69 (2004) 052319.

Feldman P., A practical scheme for non-interactive verifiable secret sharing, In: Proceedings of 28th IEEE Symposium on Foundations of Computer Science, pp. 427-437 (1987).

Hillery M., Buzek V. and Berthiaume A., Quantum secret sharing, Phys. Rev. A 59 (1999) 1829-1834.

Hsu J. L., Chong S. K., Hwang T. and Tsai C. W., Dynamic quantum secret sharing, Quantum Inf. Process. 12 (2013), 331-344.

Li Q., Long D. Y., Chan W. H. and Qiu D. W., Sharing a quantum secret without a trusted party, Quantum Inf. Process. 10 (2011) 97-106.

Lin Y. and Wu T., (t, n)-Threshold verifiable multi secret sharing scheme based on factorization intractability and discrete logarithm modulo a composite problems, IEEE Proc. Comput. Digit. Tech. 146(5), 264-268 (1999).

Liu L. L., Tsai C. W. and Hwang T., Quantum secret sharing using symmetric state, Int. J. Theor. Phys. 51 (2012) 2291-2306.

Nielsen M. and Chuang I., Quantum Computation and Quantum Information, pp. 28-43. Cambridge University Press, Cambridge (2000).

Shamir A., How to share a secret ?, Communications of the ACM, 22(11): 612-613, 1979.

Shor P. W., Algorithms for quantum computation: discrete logarithms and factoring, In: Proceedings of the 35th Annual Symposium of Foundation of Computer Science (1994).

Stadler M., Publicly Verifiable Secret Sharing, EUROCRYPT96. pp. 190-199. Springer, Berlin (1996).

Sun Y., Xu S. W., Chen X. B., Niu X. X. and Yang Y. X., Expansible quantum secret sharing network, Quantum Inf. Process. 12 (2013) 2877-2888.

Tseng H.Y., Tsai C. W., Hwang T. and Li C. M., Quantum secret sharing based on quantum search algorithm, Int. J. Theor. Phys. 51 (2012), 3101-3108.

Yang Y. G., Jia X., Wang H. Y. and Zhang H., Verifiable quantum (k, n)-threshold secret sharing, Quantum Inf. Process. 11 (2012), 1619-1625.

Yang Y. G., Teng Y. W., Chai H. P. and Wen Q. Y., Verifiable quantum (k, n)-threshold secret key sharing, Int. J. Theor. Phys. 50 (2011), 792-798.

DOI: https://doi.org/10.23956/ijarcsse.v7i7.95


  • There are currently no refbacks.

© International Journals of Advanced Research in Computer Science and Software Engineering (IJARCSSE)| All Rights Reserved | Powered by Advance Academic Publisher.