2017International Journal of Advanced Research in Computer Science and Software EngineeringRequires access

A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method

Manoj Kumar

Open publisher page 1 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Verifiable secret sharing, Secret sharing, Computer science, Homomorphic secret sharing, Secure multi-party computation, Key distribution, Interpolation (computer graphics), Key (lock)

Related papers

Back to paper searchBrowse research topicsOriginal source
A Verifiable Threshold Quantum Secret Sharing Scheme Using Interpolation Method — Research Paper | ScholarLens