A Verifiable Quantum Secret Sharing Scheme Based on a Single Qubit

03/09/2020
by   Dan-Li Zhi, et al.
0

To detect frauds from some internal participants or external attackers, some verifiable threshold quantum secret sharing schemes have been proposed. In this paper, we present a new verifiable threshold structure based on a single qubit using bivariate polynomial. First, Alice chooses an asymmetric bivariate polynomial and sends a pair of values from this polynomial to each participant. Then Alice and participants implement in sequence unitary transformation on the d-dimensional quantum state based on unbiased bases, where those unitary transformations are contacted by this polynomial. Finally, security analysis shows that the proposed scheme can detect the fraud from external and internal attacks compared with the exiting schemes and is comparable to the recent schemes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2020

A quantum secret sharing scheme with verifiable function

In the ( t,n) threshold quantum secret sharing scheme, it is difficult t...
research
01/11/2018

Breaking Mignotte's Sequence Based Secret Sharing Scheme Using SMT Solver

The secret sharing schemes are the important tools in cryptography that ...
research
11/13/2022

Concatenating Extended CSS Codes for Communication Efficient Quantum Secret Sharing

Recently, a class of quantum secret sharing schemes called communication...
research
06/11/2019

New dynamic and verifiable multi-secret sharing schemes based on LFSR public key cryptosystem

A verifiable multi-secret sharing (VMSS) scheme enables the dealer to sh...
research
03/01/2023

Efficient Quantum Secret Sharing Scheme Based On Monotone Span Program

How to efficiently share secrets among multiple participants is a very i...
research
11/17/2020

New (k,l,m)-verifiable multi-secret sharing schemes based on XTR public key system

Secret sharing was proposed primarily in 1979 to solve the problem of ke...
research
02/18/2022

Post-quantum Multi-stage Secret Sharing Schemes using Inhomogeneous Linear Recursion and Ajtai's Function

Secret sharing was firstly proposed in 1979 by Shamir and Blakley respec...

Please sign up or login with your details

Forgot password? Click here to reset