Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Verifiable quantum secret sharing method

A quantum secret and secret sharing technology, applied in the field of verifiable quantum secret sharing, can solve problems such as not meeting the security requirements of secret sharing

Active Publication Date: 2019-08-30
LUOYANG NORMAL UNIV
View PDF8 Cites 4 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, this scheme has the following security problems: the first participant can obtain the secret of the secret distributor by directly measuring the encoded state sent by the secret distributor with a probability of 1 / d without being discovered , which does not satisfy the security requirement for secret sharing

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Verifiable quantum secret sharing method
  • Verifiable quantum secret sharing method
  • Verifiable quantum secret sharing method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0027] The technical solutions of the present invention will be further described below in conjunction with specific embodiments.

[0028] A verifiable quantum secret sharing method, comprising the following steps:

[0029] Step 1, sub-secret distribution stage

[0030] Let Alice denote the secret distributor, Bob 1 , Bob 2 ,..., Bob n represent n agents respectively, the specific process is as follows:

[0031] (1) Alice randomly selects three polynomials

[0032]

[0033] here, in As the main secret, GF(d) is a finite field whose order is an odd prime number d;

[0034] (2) For each agent Bob j (j=1,2,...,n), Alice calculates f v (x j )(v=1,2,3) as Bob j subsecret of x j for Bob j public identity information of , and x j ≠x r Unless j=r; then, Alice uses the secure channel to transfer f 1 (x j ), f 2 (x j ), f 3 (x j ) to Bob j ;

[0035] Step 2. Secret sharing stage

[0036] Suppose Alice intends to share the secret M 1 and M 2 Distributed to m ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention relates to a verifiable quantum secret sharing method, which comprises the following steps that: step 1, Alice calculates fv (xj) (v = 1, 2, 3) as a sub-secret of Bobj, and sends f1 (xj), f2 (xj) and f3 (xj) to the Bobj by using a secure channel; step 2, a participant P1 prepares three same quantum states and sends the three same quantum states to a P2, the participant P2 executes operation similar to the P1 and sends the quantum states to the participant P3, and other participants also execute operation similar to the P1 and send the quantum states to Alice after operation of the last Pm is completed; (4) Alice measures three quantum states and sends measurement results R1, R2 and R3 to m participants P1, P2,..., Pm; and step 3, a secret recovery stage: if m participants P1,P2,..., Pm want to recover secrets M1 and M2, the participants P1, P2,..., Pm submit three random numbers at the same time and calculate and verify whether the secrets M1 and M2 are true or not. According to the method and the device, the problem that the secret of the secret dispatcher is obtained by the first participant through a method of randomly selecting the measurement base to directly measure the coding state sent by the secret dispatcher under the condition that the first participant is not discovered in the existing scheme can be solved.

Description

technical field [0001] The invention relates to the technical field of information security, in particular to a verifiable quantum secret sharing method. Background technique [0002] In 1979, Shamir and Blakley independently proposed the concept of secret sharing. In the (t,n) threshold secret sharing scheme, the secret distributor (dealer) divides the secret into n shares, and distributes each share to the corresponding n agents (Agents), so that any t agents The secret of the secret distributor can be recovered, and any information less than t agents cannot obtain the secret. This special property of secret sharing effectively solves the problem of distributed storage of secret data in an untrustworthy environment, and also plays a key role in the transmission and legal utilization of important information and secret data. [0003] However, in some special cases, the secret distributor may also engage in fraud for some benefit, that is, the secret distributor may distri...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/08
CPCH04L9/085H04L9/0852H04L9/0869
Inventor 王天银蔡晓秋张瑞玲魏春艳
Owner LUOYANG NORMAL UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com