CN113538120B - Anonymous quantum seal auction method - Google Patents

Anonymous quantum seal auction method Download PDF

Info

Publication number
CN113538120B
CN113538120B CN202110930601.2A CN202110930601A CN113538120B CN 113538120 B CN113538120 B CN 113538120B CN 202110930601 A CN202110930601 A CN 202110930601A CN 113538120 B CN113538120 B CN 113538120B
Authority
CN
China
Prior art keywords
quantum
auctioneer
classical
bidder
register
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110930601.2A
Other languages
Chinese (zh)
Other versions
CN113538120A (en
Inventor
石润华
李恩
高伟
吴明霞
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
North China Electric Power University
Original Assignee
North China Electric Power University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by North China Electric Power University filed Critical North China Electric Power University
Priority to CN202110930601.2A priority Critical patent/CN113538120B/en
Publication of CN113538120A publication Critical patent/CN113538120A/en
Application granted granted Critical
Publication of CN113538120B publication Critical patent/CN113538120B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/08—Auctions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
    • H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
    • H04L9/0852—Quantum cryptography

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Marketing (AREA)
  • Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Electromagnetism (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses an anonymous quantum seal auction method which is applied to a classical auctioneer A 1 And a quantum auctioneer A 2 In a classical and quantum hybrid network composed of n bidders, two auctioneers supervise each other; first classical auctioneer A 1 Generating and distributing system parameters, quantum auctioneer A 2 Sharing a random secret to n bidders; next, each bidder calculates the promise value of the respective quotation by adopting a classical hash method and sends the promise value to A 1 The method comprises the steps of carrying out a first treatment on the surface of the Then A 2 Assisting each bidder to calculate a secret sum by adopting a quantum security multiparty summation method; further, based on the secret sum and system parameters, A 2 Calculate and select the highest bid x k The method comprises the steps of carrying out a first treatment on the surface of the Finally, at A 1 Under supervision of candidate winner B k An authentication of the owner is received. The invention can effectively realize the anonymity and non-repudiation of the bidder identity in the sealed auction process, enhance the safety in the information transmission process, and simultaneously ensure the fairness and the verifiability of the auction.

Description

Anonymous quantum seal auction method
Technical Field
The invention relates to a quantum seal auction, a quantum secret sharing protocol and a China remainder theorem, in particular to a method suitable for the quantum seal auction to ensure anonymity, fairness, verifiability, confidentiality and non-repudiation.
Background
With the continuous development of social economy, auctions are used as a special commodity transaction mode, and the work and life of people are deeply influenced. The auctions can be classified into english auctions, netherlands auctions, and sealed bid auctions according to different process formats. English auctions are also known as price increasing auctions; the netherlands auction follows a price decreasing rule; sealing bidding auction means that bidders submit bidding information in a secret way within a certain time, bidding is uniformly opened according to a certain rule after the bidding procedure is finished, and a result can be generated only by bidding for one round. The rapid development of internet economy and the rapid rise of electronic commerce are achieved, and meanwhile, the sealed bidding auction becomes the most popular electronic commerce application form in recent years due to the advantages of saving time and cost, hiding bidding price, protecting the privacy of bidders and the like.
The birth and development of quantum cryptography has important significance for the development of quantum communication. For example, the first quantum key distribution protocol BB84 protocol enables unconditionally secure communications. Meanwhile, other kinds of quantum encryption protocols, such as quantum secret sharing, quantum secure direct transmission, quantum public key encryption and the like, are also getting more and more attention. After this, recognizing the defect that classical electronic auctions cannot guarantee unconditional security, many researchers have replaced classical encryption techniques with quantum computing and quantum communication related techniques, gradually trying methods of quantum auctions.
In a typical quantum-sealed bid auction method, all sealed bids are submitted to the auctioneer simultaneously so that the auctioneer can open the bids and select the highest bid. Thus, each bidder's identity and bid (including the failed bidder) will be revealed to the auctioneer. Thus, these agreements require a trusted auctioneer. However, it is difficult to find a completely trusted third party in the real world. That is, since an accurate assessment of the auction item is considered to be a trade secret, the auctioneer may be dishonest and may disclose a failed bid to other bidders. In addition, some existing quantum-sealed auction protocols are unfair, i.e., malicious auctioneers can collusion attack with dishonest auctioneers to obtain unfair auctions.
Disclosure of Invention
The invention aims to solve the defects of the prior art, and provides an anonymous quantum seal auction method which is used for effectively realizing the anonymity and non-repudiation of the identity of bidders in the seal bidding auction process, thereby enhancing the security in the information transmission process and simultaneously ensuring the fairness and the verifiability of the auction.
The invention adopts the technical scheme for solving the technical problems that:
the invention relates to an anonymous quantum seal auction method, which is characterized by being applied to a classical auctioneer A 1 Quantum auctioneer A 2 In a classical and quantum mixed network composed of n bidders, an arbitrary ith bidder is marked as B i I=1, 2, …, n; the quantum seal auction method is carried out according to the following steps:
step 1. According to the China remainder theorem, the classical auctioneer A 1 Generating and distributing system parameters, said quantum auctioneer A 2 Sharing a random secret to the n bidders;
step 1.1, the classical auctioneer A 1 Generating n integer { m } of mutual quality 1 ,m 2 ,...,m i ,...,m n -wherein m i Represents an ith integer; calculating the product M of n pairwise prime integers by using the method (1), dividing the ith integer M i Product M of n-1 integers other than i ：
According to (1), is provided withFor the product M i And the ith integer m i Inverse of the modulus of (2), and M i t i ≡1(modm i )；
Step 1.2, using QKD or face-to-face approach for the classical auctioneer A 1 And the ith bidder B i Assigning shared keysFor the classical auctioneer a 1 And the quantum auctioneer a 2 Assigning a shared key->
Said classical auctioneer a 1 For the ith bidder B i DispensingAnd->Wherein (1)>And->Representing the key->One-time pad encryption and message authentication code; then the n integers { m } of mutual quality 1 ,m 2 ,...,m i ,...,m n Random scrambling of order and use of the key +.>Encrypting to obtain ciphertext and then obtaining the ciphertext and the message authentication code +.>Together sent to the quantum auctioneer a 2 ；
Step 1.3, the classical auctioneer A 1 Generating a strong anti-collision hash function h (·) and publishing the generated product M of the n pairwise prime integers on an electronic bulletin board;
step 1.4, quantum auctioneer A 2 Sharing a random secret k= (k) among the n bidders through a quantum secret sharing protocol 1 +k 1 +...+k n ) mod M such that the ith bidder B i Obtaining a corresponding sub-secret k i ；
Step 2, the ith bidder B i Generating a random number r of the self i For calculating self-quotation x i Is promised by (a)And commits the commitment c i Sent to the classical auctioneer a via a classical channel 1 ；
Step 3, the quantum auctioneer A 2 Calculating the sum of quotation secret values of all bidders by adopting quantum security multiparty summation method
Step 4, according to the ith integer m i And the sum X of the quotation secret values, the quantum auctioneer A 2 Calculating offers of all bidders using the chinese remainder theorem and selecting candidate winning price x from the n bidders k ；
Step 5, the candidate winning price x k Corresponding candidate winner B k Receiving verification of all parties;
step 5.1, the Quantum auctioneer A 2 Publishing said candidate winning price x k And the corresponding integer m k ；
Step 5.2 if other bidder B j Verifying quotation x to itself j Comparing the candidate winning price x k Large, the corresponding bidder wins the current candidate price x k Broadcasting an incorrect complaint information and requiring the classical auctioneer a 1 Verifying;
step 5.3, the classical auctioneer A 1 Verifying the bidder B j Said quotation x j If verified as authentic, representing the candidate winning price x k If not, ending the auction process, otherwise, executing the step 5.4;
step 5.4, candidate winner B k According to the common information (x k ,m k ) Declaring itself the winner and publishing the random number r k Said classical auctioneer a 1 Based on the random number r k Opening the winner B k Promise c of (C) k And verifies the promise c k If verification is successful, then the authenticity of (a) is determinedThe candidate winner B k Ending the auction for the auction winner; otherwise, the final verification fails, and the auction is ended.
The anonymous quantum seal auction method is characterized in that in the step 3, the sum X of quotation secret values of all bidders is calculated according to the following steps:
step a), initializing i=1;
quantum auctioneer A 2 Generating an entangled state containing 2M qubits in M-dimensional Hilbert spaceAnd the entangled state +.>M qubits of the register h are placed in a register t, and m qubits entangled with the qubits in the register h are placed in a register t; and then the register t is transmitted to the ith bidder B through a quantum channel i ；
Step B), the ith bidder B i Calculating quotation secret valuesThereby performing a phase transformation U (b) on said register t i ) And then send to the (i+1) th bidder B i+1 ；
Step c), after assigning i+1 to i, judging whether i=n is satisfied, if so, the n-th bidder B n Performing a phase transformation U (b) on said register t n ) And then send to the quantum auctioneer A 2 Otherwise, returning to the step b for execution;
step d), the quantum auctioneer A 2 Taking m quantum bits in the register h as control bits, taking m quantum bits in the register t as target bits, performing m CNOT gate operations on the control bits and the target bits, then disentangling the m quantum bits in the register h and the m quantum bits in the register t, and measuring the register t by using a calculation baseM quantum bits in the matrix to perform honest verification; when the verification is passed, executing the step e; otherwise, terminating the auction process;
step e) the quantum auctioneer A 2 After performing a phase transformation U (-k) on the register h, performing an inverse quantum fourier transform on the register h and measuring to obtain a sum X of secret values.
Compared with the existing quantum seal bidding auction method, the method has the beneficial effects that:
1. the invention uses the shared secret key to verify the legal identity of the bidding person, thereby realizing identity authentication and improving the security of the system.
2. In the present invention, although the quantum auctioneer A 2 Each specific bid can be obtained but he does not know who is the bid except the winner, thus ensuring anonymity of the system.
3. In the present invention, since there is a classical auctioneer A 1 Such that the quantum auctioneer a 2 The system can not collusion with dishonest bidders, thus resisting collusion attack of dishonest auctioneers and bidders and improving the robustness of the system.
4. The classical commitment protocol in the invention ensures non-repudiation of the bidder and verifiability of the auction, and improves the completeness of the system.
5. In the invention, all bidders have equal functions and equal probability of acquiring privacy information of other parties, thereby ensuring fairness of the system.
Drawings
FIG. 1 is a system block diagram of the present invention;
FIG. 2 is a quantum wire diagram of quantum secret sharing of the present invention;
fig. 3 is a quantum wire diagram of the secure multiparty summation of the present invention.
Detailed Description
In this embodiment, as shown in FIG. 1, an anonymous quantum seal auction method is applied to a classical auction company A 1 And a quantum auctioneer A 2 In a mixed network of classical and quantum composed of N bidders, itIn the process, ,
(1) classical auctioneer A 1 Generating and distributing classical system parameters, and accepting quotation commitments of each bidder; the quantum auctioneer is supervised to prevent it from collusion with dishonest bidders.
(2) Quantum auctioneer A 2 The total of the secret values of the quotes of all bidders is calculated by adopting a quantum security multiparty summation method, so that the quotes of all bidders are calculated, but the bidders corresponding to each quote are not known.
(3) Record any bidder as B i The promise value of each quotation is calculated by adopting a classical hash method and is sent to a classical auctioneer A 1 And embedding the respective quotation cell secrets into the phase of the same quantum entangled state and finally sending to quantum auctioneer a 2 The quantum auctioneer extracts the phase information and selects the highest bid in combination with the chinese remainder theorem.
Specifically, the quantum seal auction method is carried out according to the following steps:
step 1. Classical auctioneer A according to the China remainder theorem 1 Generating and distributing system parameters, quantum auctioneer A 2 Sharing a random secret to n bidders;
step 1.1 classical auctioneer A 1 Generating n integer { m } of mutual quality 1 ,m 2 ,...,m i ,...,m n -wherein m i Represents an ith integer; calculating the product M of n pairwise prime integers and dividing the product M by the ith integer M by using the method (1) i Product M of n-1 integers other than i ：
According to (1), is provided withIs M i And m is equal to i Inverse of the modulus of (2), and M i t i ≡1(mod m i )；
Setting all integers { m } 1 ,m 2 ,...,m i ,...,m n Has the same bit length and each offer x i ＜m i ；
Step 1.2 classical auctioneer A with QKD or face-to-face 1 And (i) th bidder B i Assigning shared keysFor classical auctioneer A 1 And Quantum auctioneer A 2 Assigning a shared key->
Classical auctioneer A 1 For the ith bidder B i DispensingAnd->Wherein (1)>And->Representing key->One-time pad encryption and message authentication code; then n integers { m } of mutual quality 1 ,m 2 ,...,m i ,...,m n Random scrambling and use of secret key +.>Encrypting to obtain cipher text and then combining with the information authentication codeTogether send to Quantum auctioneer A 2 ；
Step 1.3 classical auctioneer A 1 Generating a strong anti-collision hash function h (·) and publishing the strong anti-collision hash function h (·) on an electronic bulletin board together with the product M of n pairwise prime integers;
step 1.4, quantum auctioneer A 2 Sharing a random secret k= (k) among n bidders through a quantum secret sharing protocol 1 +k 1 +...+k n ) mod M such that the ith bidder B i Obtaining a corresponding sub-secret k i The method comprises the steps of carrying out a first treatment on the surface of the As shown in fig. 2, the steps of the quantum secret sharing protocol are as follows:
a) Quantum auctioneer A 2 Preparation of 1 Quantum State in Hilbert space in M dimensionAnd n ground states->Where the subscript i denotes an i-th register (i=0, 1..n), setting
b) Quantum auctioneer A 2 Quantum state is paired through m CNOT gatesAnd each ground state->Conversion is performed so that quantum auctioneer A 2 The following quantum states were obtained:
c) Quantum auctioneer A 2 For each register |x> i Performing unitary transformsThe specific transformation is as follows:
the whole quantum system is:
d) Quantum auctioneer A 2 Register via quantum channelTo any ith bidder B i (i=0, 1,) n, while |x> 0 Stored in the hands of the user;
e) Any ith bidder B i The received ith registerPerforming unitary transformation->
So that all legal bidders can recover the initial quantum state after executing the corresponding operation
f) Quantum auctioneer A 2 And any ith bidder B i The quantum fourier transforms are performed on the registers in their hands, respectively, so equation (5) is obtained:
g) Quantum auctioneer A 2 And any ith bidder B i Measuring their registers separately using computation basesQuantum state, set quantum auction A 2 And any ith bidder B i The measurement results of (1) are k respectively 0 And k i Quantum auctioneer A 2 Calculating k=m-k 0 。
Step 2, ith bidder B i Generating a random number r of the self i For calculating self-quotation x i Is promised by (a)And will promise c i Sent to classical auctioneer a via classical channel 1 ；
Step 3, quantum auction merchant A 2 Calculating the sum of quotation secret values of all bidders by adopting quantum security multiparty summation method
As shown in fig. 3, the quantum security multiparty summation method is performed as follows:
step a), initializing i=1;
quantum auctioneer A 2 Generating an entangled state containing 2M qubits in M-dimensional Hilbert spaceAnd entangled state->M qubits in (a) are placed in a register h, and m qubits entangled with the qubits in the register h are placed in a register t; then the register t is sent to the ith bidder B through the quantum channel i The method comprises the steps of carrying out a first treatment on the surface of the Definition of qubit entangled state->
Step B), ith bidder B i Calculating a quotation secret value b i ＝k i +x i M i M i -1 Thereby performing a phase transformation on the register tU(b i ) And then send to the (i+1) th bidder B i+1 The method comprises the steps of carrying out a first treatment on the surface of the Wherein the phase is shifted by U (b i )：Thus, the formula (6) is obtained:
step c), after assigning i+1 to i, judging whether i=n is satisfied, if so, the n-th bidder B n Performing phase transformation U (b) on register t n ) And then send to the quantum auctioneer A 2 Otherwise, returning to the step b for execution;
step d), quantum auction merchant A 2 Taking m quantum bits in a register h as control bits, taking m quantum bits in a register t as target bits, performing m CNOT gate operations on the control bits and the target bits, then removing entanglement of the m quantum bits in the register h and the m quantum bits in the register t, measuring the m quantum bits in the register t by using a calculation base, and performing honest verification; when the verification is passed, executing the step e; otherwise, terminating the auction process; the resulting quantum state is of formula (7):
quantum auctioneer A 2 Verifying whether the measurement result is by using the calculation-based measurement register tIf the verification is passed, executing the next step, otherwise, terminating the protocol.
Step e), quantum auction merchant A 2 After performing a phase transformation U (-k) on the register h, and performing an inverse quantum fourier transform on the register h and measuring to obtain a sum X of secret values. Quantum auctioneer A 2 Performing a phase transformation U (-k) on register h yields equation (8):
quantum auctioneer A 2 An inverse quantum fourier transform is performed on register h, so that equation (9) is obtained:
step 4, according to the ith integer m i And the sum X of the quotation secret values, quantum auctioneer A 2 Calculating offers of all bidders using the chinese remainder theorem, and selecting candidate winning price x from n bidders k The method comprises the steps of carrying out a first treatment on the surface of the Quantum auctioneer A 2 Calculating x i ＝Xmodm i Wherein each m i From the disordered sequence (e.g., { m 3 ,m n ,...,m 1 }) and selects a candidate winning price x k ；
Step 5, candidate winning price x k Corresponding candidate winner B k Receiving verification of all parties;
step 5.1, quantum auction A 2 Publishing candidate winning price x k And the corresponding integer m k ；
Step 5.2 if other bidder B j Verifying quotation x to itself j Winning price x of the ratio candidate k Large, the corresponding bidder wins the current candidate price x k Broadcasting an incorrect complaint information and requiring classical auctioneer a 1 Verifying;
step 5.3 classical auctioneer A 1 Verifying bidder B j Offer x j If verified as authentic, then the candidate winning price x is represented k If not, ending the auction process, otherwise, executing the step 5.4;
step 5.4 candidate winner B k According to the common information (x k ,m k ) Declaring itself the winner and publishing the random number r k Classical auctioneer a 1 According to random number r k Open winner B k Promise c of (C) k And verifies promise c k If verification is successful, candidate winner B is identified k Ending the auction for the auction winner; otherwise, the final verification fails, and the auction is ended.
The specific verification process is as follows:
a) From the common information, each part calculatesAnd verifies (10):
the present invention will be described in further detail with reference to the correctness, safety, and fairness in examples.
Examples:
a) Correctness of
Firstly, analyzing the correctness of the quantum secret sharing protocol in the initialization stage of the invention, wherein the correctness of the protocol is ensured by the formula (11):
from equation (7), formula (12) is obtained:
therefore, if each part measures its own register, the entangled stateCollapse to the separable state->And measurement result k i Is random but must meetBecause k=m-k 0 ,k＝(k 1 +k 1 +...+k n ) ModM, that is->The correctness of equation (9) can be ensured.
Thus, according to the Chinese remainder theorem, if all integers m i Two by two, then have formula (13):
in the formula (13), the amino acid sequence of the compound,definitions->M i ＝M/m i And->Wherein->Is M i Mould m i The reciprocal of the number theory of (c).
If Quantum auctioneer A 2 Knowing X and m i Quantum auctioneer A 2 The corresponding x can be obtained by equation (13) i . From equation (9), it can be seen that the quantum security multiparty summation method is for computationWherein x is i For bidder B i Is a self-bid for (1). Therefore, the Chinese remainder theorem ensures the correctness of the protocol proposed by us.
b) Safety:
(1) Classical auctioneer A 1 Distributing system parameters in a one-time-pad manner, which is unconditionalSafety;
(2) Quantum auctioneer A 2 The proposed quantum secret sharing protocol is secure because bidder B i Is a secret k of (2) i Is totally private unless it includes a quantum auctioneer A 2 Collusion of the n participants therein, except bidder B i Other participants cannot know about k i Any of the private information of (a);
(3) The proposed commitment protocol is secure, and the strong anti-collision hash function according to the commitment protocol can resist the attack of the quantum computer;
(4) The proposed secure multiparty computing summing protocol is theoretically secure;
c) Fairness:
all bidders performed the same procedure: one is to submit the bid promise to classical auctioneer A 1 Secondly, help quantum auctioneer A 2 The sum of all bids is calculated.
In conclusion, the correctness of the protocols, theorem, formulas and the like provided by the invention is verified. The manner in which the system parameters are distributed by analyzing some of the protocols proposed is secure. All bidders perform the same procedure, so that fairness of the present invention is ensured. In addition, the auction merchant does not know the identity of any other bidder except the bidder, thereby ensuring confidentiality, the auction merchant does not know which bidder the bid of the loser belongs to, and anonymity is ensured. The invention can effectively solve the problem that the auctioneer can disclose failed quotations to other auctioneers and the malicious auctioneer and dishonest auctioneer can collusion attack, so the invention has good application in the future classical and quantum mixed network.

Claims (2)

1. An anonymous quantum seal auction method is characterized by being applied to a classical auctioneer A 1 Quantum auctioneer A 2 In a classical and quantum mixed network composed of n bidders, an arbitrary ith bidder is marked as B i I=1, 2, …, n; the quantum seal auction method is carried out according to the following steps:
step 1. According to the China remainder theorem, the classical auctioneer A 1 Generating and distributing system parameters, said quantum auctioneer A 2 Sharing a random secret to the n bidders;
step 1.1, the classical auctioneer A 1 Generating n integer { m } of mutual quality 1 ,m 2 ,...,m i ,...,m n -wherein m i Represents an ith integer; calculating the product M of n pairwise prime integers by using the method (1), dividing the ith integer M i Product M of n-1 integers other than i ：
According to (1), is provided withFor the product M i And the ith integer m i Inverse of the modulus of (2), and M i t i ≡1(mod m i )；
Step 1.2, using QKD or face-to-face approach for the classical auctioneer A 1 And the ith bidder B i Assigning shared keysFor the classical auctioneer a 1 And the quantum auctioneer a 2 Assigning a shared key->
Said classical auctioneer a 1 For the ith bidder B i DispensingAnd->Wherein (1)>And->Representing the key->One-time pad encryption and message authentication code; then the n integers { m } of mutual quality 1 ,m 2 ,...,m i ,...,m n Random scrambling of order and use of the key +.>Encrypting to obtain ciphertext and then obtaining the ciphertext and the message authentication code +.>Together sent to the quantum auctioneer a 2 ；
Step 1.3, the classical auctioneer A 1 Generating a strong anti-collision hash function h (·) and publishing the generated product M of the n pairwise prime integers on an electronic bulletin board;
step 1.4, quantum auctioneer A 2 Sharing a random secret k= (k) among the n bidders through a quantum secret sharing protocol 1 +k 1 +...+k n ) mod M such that the ith bidder B i Obtaining a corresponding sub-secret k i ；
Step 2, the ith bidder B i Generating a random number r of the self i For calculating self-quotation x i Is promised by (a)And commits the commitment c i Sent to the classical auctioneer a via a classical channel 1 ；
Step 3, the quantum auctioneer A 2 Calculating the sum of quotation secret values of all bidders by adopting quantum security multiparty summation method
Step 4, according to the ith integer m i And the sum X of the quotation secret values, the quantum auctioneer A 2 Calculating offers of all bidders using the chinese remainder theorem and selecting candidate winning price x from the n bidders k ；
Step 5, the candidate winning price x k Corresponding candidate winner B k Receiving verification of all parties;
step 5.1, the Quantum auctioneer A 2 Publishing said candidate winning price x k And the corresponding integer m k ；
Step 5.2 if other bidder B j Verifying quotation x to itself j Comparing the candidate winning price x k Large, the corresponding bidder wins the current candidate price x k Broadcasting an incorrect complaint information and requiring the classical auctioneer a 1 Verifying;
step 5.3, the classical auctioneer A 1 Verifying the bidder B j Said quotation x j If verified as authentic, representing the candidate winning price x k If not, ending the auction process, otherwise, executing the step 5.4;
step 5.4, candidate winner B k According to the common information (x k ,m k ) Declaring itself the winner and publishing the random number r k Said classical auctioneer a 1 Based on the random number r k Opening the winner B k Promise c of (C) k And verifies the promise c k If verification is successful, then the candidate winner B is identified k Ending the auction for the auction winner; otherwise, the final verification fails, and the auction is ended.
2. The anonymous quantum seal auction method of claim 1, wherein in the step 3, the sum X of the bid secret values of all bidders is calculated as follows:
step a), initializing i=1;
quantum auctioneer A 2 Generating an entangled state containing 2M qubits in M-dimensional Hilbert spaceAnd the entangled state +.>M qubits of the register h are placed in a register t, and m qubits entangled with the qubits in the register h are placed in a register t; and then the register t is transmitted to the ith bidder B through a quantum channel i ；
Step B), the ith bidder B i Calculating quotation secret valuesThereby performing a phase transformation U (b) on said register t i ) And then send to the (i+1) th bidder B i+1 ；
Step c), after assigning i+1 to i, judging whether i=n is satisfied, if so, the n-th bidder B n Performing a phase transformation U (b) on said register t n ) And then send to the quantum auctioneer A 2 Otherwise, returning to the step b for execution;
step d), the quantum auctioneer A 2 Taking m quantum bits in the register h as control bits, taking m quantum bits in the register t as target bits, performing m CNOT gate operations on the control bits and the target bits, then disentangling the m quantum bits in the register h and the m quantum bits in the register t, and measuring the m quantum bits in the register t by using a calculation base to perform honest verification; when the verification is passed, executing the step e; otherwise, terminating the auction process;
step e) the quantumAuctioneer A 2 After performing a phase transformation U (-k) on the register h, performing an inverse quantum fourier transform on the register h and measuring to obtain a sum X of secret values.
CN202110930601.2A 2021-08-13 2021-08-13 Anonymous quantum seal auction method Active CN113538120B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110930601.2A CN113538120B (en) 2021-08-13 2021-08-13 Anonymous quantum seal auction method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110930601.2A CN113538120B (en) 2021-08-13 2021-08-13 Anonymous quantum seal auction method

Publications (2)

Publication Number Publication Date
CN113538120A CN113538120A (en) 2021-10-22
CN113538120B true CN113538120B (en) 2023-11-03

Family

ID=78122405

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110930601.2A Active CN113538120B (en) 2021-08-13 2021-08-13 Anonymous quantum seal auction method

Country Status (1)

Country Link
CN (1) CN113538120B (en)

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109495241A (en) * 2017-09-11 2019-03-19 安徽大学 Post-confirmation method for quantum seal bidding auction

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20170372412A1 (en) * 2016-06-27 2017-12-28 QC Ware Corp. Quantum-Annealing Computer Method for Selecting the Optimum Bids in a Combinatorial Auction
US20190354962A1 (en) * 2018-05-18 2019-11-21 Qredo Ltd. Distributed Ledger Payments Platform for Telecoms

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109495241A (en) * 2017-09-11 2019-03-19 安徽大学 Post-confirmation method for quantum seal bidding auction

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Quantum Sealed-Bid Auction Without a Trusted Third Party;Run-Hua Shi;《IEEE Transactions on Circuits and Systems I: Regular Papers》;第68卷(第10期);全文 *

Also Published As

Publication number Publication date
CN113538120A (en) 2021-10-22

Similar Documents

Publication Publication Date Title
US6834272B1 (en) Privacy preserving negotiation and computation
CN109495465A (en) Privacy set intersection method based on intelligent contract
CN111191280A (en) Block chain transaction method based on encrypted data, electronic equipment and storage medium
CN106161415A (en) A kind of information processing method and mobile gunz perception application platform
Abulkasim et al. Quantum-based privacy-preserving sealed-bid auction on the blockchain
Shi Quantum sealed-bid auction without a trusted third party
Larson et al. Secure auctions without an auctioneer via verifiable secret sharing
Shi et al. Cryptanalysis and improvement of quantum sealed-bid auction
CN110932856B (en) Verifiable quantum key negotiation method
CN113538120B (en) Anonymous quantum seal auction method
Wang et al. A quantum sealed auction protocol based on secret sharing
Wu et al. A secure quantum sealed-bid auction protocol based on quantum public key encryption
Han et al. Quantum sealed-bid auction protocol based on semi-honest model
Liu et al. Multiparty Sealed-Bid auction protocol based on the correlation of Four-Particle entangled state
Hao et al. Multi-agent system for e-commerce security transaction with block chain technology
Wang et al. Sealed-bid auction scheme based on blockchain and secure multi-party computation
Xu et al. Quantum sealed-bid auction protocol for simultaneous ascending auction with GHZ states
Rao Paras-A Private NFT Protocol
CN113541963A (en) TEE-based extensible secure multi-party computing method and system
CN113628017B (en) Quantum sealed auction method based on quantum public key cryptography
CN112116414A (en) Auction type safe nearest neighbor target base source searching system and method supporting range verification
CN113660084B (en) Quantum sealing auction method without auction trader
Gao et al. A privacy-preserving quantum sealed-bid auction protocol with EPR pairs
Chenli et al. Fair 2 Trade: Digital Trading Platform Ensuring Exchange and Distribution Fairness
Rajkumar et al. LKH Model based Enhancing Security in E-Auction System for Cloud Communication

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant