CN109272391A - A kind of safe Business negotiation agreement of two sides based on quantum mechanical - Google Patents

A kind of safe Business negotiation agreement of two sides based on quantum mechanical Download PDF

Info

Publication number
CN109272391A
CN109272391A CN201811172636.9A CN201811172636A CN109272391A CN 109272391 A CN109272391 A CN 109272391A CN 201811172636 A CN201811172636 A CN 201811172636A CN 109272391 A CN109272391 A CN 109272391A
Authority
CN
China
Prior art keywords
seller
quantum
buyer
state
oracle
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.)
Pending
Application number
CN201811172636.9A
Other languages
Chinese (zh)
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.)
Nanjing University of Information Science and Technology
Original Assignee
Nanjing University of Information Science and Technology
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 Nanjing University of Information Science and Technology filed Critical Nanjing University of Information Science and Technology
Publication of CN109272391A publication Critical patent/CN109272391A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • G06F21/602—Providing cryptographic facilities or services
    • 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/0601—Electronic shopping [e-shopping]
    • G06Q30/0611—Request for offers or quotes
    • 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
    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Development Economics (AREA)
  • Bioethics (AREA)
  • Health & Medical Sciences (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Health & Medical Sciences (AREA)
  • Computer Hardware Design (AREA)
  • Computer Security & Cryptography (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Technology Law (AREA)
  • Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)

Abstract

The safe Business negotiation agreement of two sides that the invention proposes a kind of based on quantum mechanical, the agreement agreement is counted by Oracle operation and quantum and obtains the commodity amount for meeting both parties' terms of trade, and Business negotiation result is obtained under the premise of not revealing the privately owned bid information of participant to realize.Compared to classical scheme, which has higher computational efficiency, i.e., only needs oracle operation three times and a quantum to count the comparison result that can be obtained N number of commodity, time complexity is reduced toMeanwhile the agreement has preferable safety, can the private information of effective guarantee buyer and the seller be not revealed to other side and third party.

Description

A kind of safe Business negotiation agreement of two sides based on quantum mechanical
Technical field
The invention belongs to quantum multi-party computations field, it is related to real using quantum Oracle operation and quantum counting algorithm The existing safe Business negotiation agreement of two sides.
Background technique
Multi-party computations (SMC) are a basic problems in distributed computing research, it refers to does not believe mutually at one In the multiple-user network appointed, each user can under the premise of not revealing respective privately owned input information cooperative cooperating to obtain some Function calculated result.Multi-party computations all have wide practical use in fields such as finance, military affairs, politics, medical treatment, and in electricity It plays a significant role in the scenes such as sub- election, electronic voting, electronic auction, privacy sharing, Threshold Signature.Currently, SMC problem exists Traditional counting field has been widely studied, and safety is the hypothesis based on computational complexity.But with computer computation ability Raising and efficiency of algorithm continuously improve, the especially appearance of quantum computer and quantum algorithm is some to be based on classics NP- Hard problem is just constantly broken through, therefore this SMC based on computational complexity is also faced with formidable challenges.Pacify with traditional counting Full property is different, and the safety under quantum mechanical, which calculates, therefore to be had potential unconditional according to quantum-mechanical physical characteristic Safety.In this context, how with quantum step response to solve the problems, such as that SMC is got growing concern for.Pacify as quantum A complete multi-party important branch for calculating (QSMC), the privately owned set computational problem of quantum obtain more and more scientific research personnel's at present Concern, the safe protocol of bargaining of two side of quantum can be considered as an example of quantum Secure set computational problem.
Under the premise of the safe Business negotiation of two sides refers to the price data for not revealing both parties, two traders carry out certain peace Full commodity price consultation: if the commodity amount for meeting terms of trade (i.e. buyer's best bid is higher than the minimum charge of the seller) is more than When specific threshold, otherwise trade is abandoned in the success of both sides' Business negotiation.Safe Business negotiation can be widely applied to protection privacy E-commerce, for example quantum auction etc..The safety of classical safe Business negotiation is based on Homomorphic Public Key Cryptosystems, still Exponential computation complexity is being needed, and traditional algorithm based on public key encryption does not fight the ability of quantum computer. Pair the present invention is directed to propose one be directed to more than one piece commodity the safe Business negotiation agreement of two side of quantum, operated by quantum Oracle Compare bid of the both sides to more than one piece commodity, and whole comparison results are summed and negotiated with threshold value comparison by throughput sub-count As a result, classic algorithm is reduced to secondary complexity compared to its complexity compared with.Multi-party computations (SMC) are distributed computings A basic problem in research, it refers in the multiple-user network of a mutual mistrust, and each user can not reveal respectively Cooperative cooperating is to obtain some function calculated result under the premise of the privately owned input information.Multi-party computations finance, it is military, The fields such as politics, medical treatment all have wide practical use, and in electronic voting, electronic voting, electronic auction, privacy sharing, door It plays a significant role in the scenes such as limit signature.Currently, SMC problem has been widely studied in traditional counting field, safety is Hypothesis based on computational complexity.But it with continuously improving for the raising of computer computation ability and efficiency of algorithm, especially measures The appearance of sub- computer and quantum algorithm, it is some just constantly to be broken through based on classics NP-hard problem therefore this based on calculating The SMC of complexity is also faced with formidable challenges.It is different from traditional counting safety, the safety of quantum multi-party computations (QSMC) Property is that therefore have potential Unconditional security according to quantum-mechanical physical characteristic.At the same time, QSMC also has warp Allusion quotation calculates incomparable potential computation capability.Therefore, lot of domestic and international researcher and technical specialist start to explore and adopt Certain classics SMC are solved the problems, such as with quantum mechanical.
As a classic applications problem of multi-party computations (SMC), the safe Business negotiation of two sides obtains more and more The concern of researcher.The safe Business negotiation of two sides refers to two trades under the premise of not revealing both parties' commodity price privacy Quotient carries out a variety of commodity price consultations: if meeting terms of trade, (i.e. commodity buyer Buyer best bid is higher than seller Seller Minimum charge) commodity amount be more than specific threshold when, both sides' Business negotiation success；Otherwise trade is abandoned.The mode can mention For the guarantee of preferable privacy and fairness, therefore with preferable real in the e-commerce such as electronic auction, even exchange With value.The existing safe Business negotiation agreement of classics be mostly based on Homomorphic Public Key Cryptosystems, safety exist with The same security risk of classical SMC；Such algorithm needs exponential computation complexity mostly simultaneously, is not suitable for large-scale Business negotiation.
Summary of the invention
The purpose of the present invention is designing a safe Business negotiation agreement of efficient two side based on quantum mechanical, the agreement is logical It crosses Oracle operation three times and a quantum counting can be obtained the commodity amount for meeting both parties' terms of trade, to realize Business negotiation result is obtained under the premise of not revealing the privately owned bid information of participant.
Technical solution is as follows:
Assuming that this agreement participant is seller Seller and buyer Buyer, minimum selling price of the seller Seller to N kind commodity Binary form be respectivelyBest bid of the buyer Buyer to N kind commodity Respectively
The operation of Oracle used in agreementWherein | i > it is an index register, Indicate nodulo-2 addition, | 0 > indicate 0 state overhead bit, it is operated using oracle and functional value f (i) is attached on overhead bit.
A threshold epsilon (1 < ε < N) is previously set in Seller and Buyer, if the threshold value is less than the bid for meeting both sides Condition (bi> si) commodity amount then both sides reach negotiation.
The safety of agreement is guaranteed by the indistinguishability of quantum non-orthogonal states, if internal listener-in or external attack Person attempts pairIt carries out projection measurement and obtains information, then he finally can only be withProbability steal it is any one The information of position | i > | bi>。
Protocol procedures are as follows:
Step 1: buyer Buyer prepares initial state | ψB>, and O is operated by OracleBEncode the best bid of N part commodity Information simultaneously generates quantum state | ψ 'B>, it is then sent to seller Seller.
Step 2: seller Seller is right | ψ 'B> carry out Oracle operation OS, encode the minimum selling price information of N part commodity and life At quantum state | ψBS>。
Step 3: Seller is right | ψBS> implement operation OfCalculate function f (si,bi) (function is used to judge siAnd biSize Relationship), obtain all judging results and form quantum state | ψ 'BS>。
Step 4: Seller is to quantum state | ψ 'BA> quantum counting is carried out, calculating meets bi> siCommodity amount t.
Step 5: Seller is by quantity t compared with threshold epsilon, and both sides reach negotiation if t > ε, otherwise negotiates failure. Final Seller announces Business negotiation result.
In step 1, buyer Buyer prepares an initial stateBuyer is right | ψB> implement Oracle operates OB, so that auxiliary state | 0 > buyer is converted to the best bid value of N part commodity | b0>,|b1>,…|bN-1>:
Obtained state is operated to be known as | ψ 'B>, then Buyer is incited somebody to action | ψ 'B> Seller is sent to by quantum channel.
In step 2, seller Seller prepares auxiliary state | and 0 > and right | ψ 'B> implement Oracle operation Os, so that auxiliary state Be converted to the lowest offer of N part commodity | s0>,|s1>,…|sN-1>:
The state of generation is known as | ψBS>。
In step 3, Seller is right again | ψBS> apply another Oracle operation Of, it is double that dealing is obtained in service bit Side is respectively to the comparison function value of N part commodity bid | f (b0,s0)>,|f(b1,s1)>,…|f(bN-1,sN-1) >:
The state of generation is known as | ψ 'BS>, wherein function
In step 4, Seller is right | ψ 'BS> implement quantum counting to calculate satisfaction | f (bi,si) > value is | 1 > commodity Quantity t meets bid price biHigher than Offering Price siCommodity amount.
In step 5, Seller will obtain quantity t compared with threshold epsilon in step 4, if meeting the commodity number of condition Amount is greater than threshold epsilon then both sides' Business negotiation success, and otherwise negotiating failure can not trade.The result finally, Seller will negotiate a price Inform Buyer.
Beneficial effect
Advantages of the present invention and effect are to realize the safe Business negotiation of two sides by quantum mechanical, should compared to classical scheme Agreement has higher computational efficiency, i.e., need to only be operated by oracle three times and a quantum counting can be obtained N number of commodity The comparison result of price, time complexity are reduced toMeanwhile the agreement have preferable safety, can effective guarantee buy The private information of side and the seller are not revealed to other side and third party.
Detailed description of the invention
The safe Business negotiation process of two side of Fig. 1 --- quantum；
Fig. 2 --- buyer operates O using OracleBEncode buyer's best bid information；
Fig. 3 --- the seller operates O using OracleSEncode seller's lowest offer information；
Fig. 4 a --- quantum of information comparator；
Fig. 5 --- multi-bit information quantum comparison device；
Fig. 6 --- the seller operates O using OraclefCompare the privately owned bid information of two sides.
Specific embodiment
Technical solution of the present invention is illustrated below in conjunction with attached drawing.
The major technique step that technical solution of the present invention is implemented is as shown in Figure 1, particular content is as follows:
(i) buyer Buyer prepares a quantum register storage initial state | ψB>, by right | ψB> implement Oracle operation OBEncode all pricing information bi.Then by the state of generation | ψ 'B> Seller is sent to by quantum channel.
(ii) after seller Seller receives the state that other side sends, O is operated by OracleSEncode all price letters Cease si, obtain state | ψBS>。
(iii) Seller implements Oracle operation Of, comparison function f (b is calculated to each commodity ii,si) value, quantum Oracle operation constructs Oracle using multidigit quantum comparison device, as shown in Figure 4 and Figure 5.
(iv) throughput sub-count algorithm, Seller obtain input stateMiddle satisfaction | f (bi,si) >=| 1 > commodity amount t.
(v) t and threshold epsilon are compared by Seller, the price negotiation success if being higher than threshold value, if negotiating lower than threshold value Failure.Agreed-upon price result is informed buyer Buyer by final Seller.
Fig. 2 describes buyer and operates O using OracleBObtain the best bid of all commodity | bi>, i.e., buyer is right | ψB> implement Oracle operates OB, so that overhead bit | 0 > state is converted to | bi>, Oracle operating process is as follows:
Fig. 3 describes the seller and operates O using OracleSObtain the lowest offer of all commodity | si>, i.e., the seller is right | ψAB> real Apply Oracle operation OS, so that overhead bit | 0 > state is converted to | si>, Oracle operating process is as follows:
Fig. 4 describes a quantum of information comparator, which compares input informationWithIf third position is defeated Result is out | 1 > thenIt is if output | 0 > ifAnd comparison result is stored on third quantum bit.
Fig. 5 describes multi-bit information quantum comparison device, is by multiple single quantum comparison door UCIt constitutes.The quantum wire ratio Compared with input information bi(bi d-1bi d-2…bi 0) and si(si d-1si d-2…si 0), if third position output result be | 1 > if bi> siIf defeated It is out | 0 > then bi≤si, and comparison result is stored on third quantum bit.
Fig. 6 seller operates O using multidigit quantum comparison device construction OraclefTo in register | 0 > state assignment is finally sentenced Disconnected two side's negotiation results, i.e.,
Wherein, comparison function f (bi,si) realized by multidigit quantum comparison device in Fig. 5.

Claims (6)

1. a kind of safe Business negotiation agreement of two sides based on quantum mechanical, which is characterized in that specific as follows:
Assuming that this agreement participant is seller Seller and buyer Buyer, seller Seller to the minimum selling prices of N kind commodity two Binary form is respectivelyBuyer Buyer distinguishes the best bid of N kind commodity For
Protocol procedures are as follows:
Step 1) buyer Buyer preparation initial state | ψB>, and O is operated by OracleBEncode the best bid information of N part commodity And generate quantum state | ψ 'B>, it is then sent to seller Seller；
Step 2) seller Seller it is right | ψ 'B> carry out Oracle operation OS, encode the minimum selling price information and production quantity of N part commodity Sub- state | ψBS>；
Step 3) Seller it is right | ψBS> implement operation OfCalculate function f (bi,si) (function is used to judge siAnd biSize is closed System), obtain all judging results and form quantum state | ψ 'BS>；
Step 4) Seller is to quantum state | ψ 'BA> quantum counting is carried out, calculating meets bi> siCommodity amount t；
Step 5) Seller is by quantity t compared with threshold epsilon, and both sides reach negotiation if t > ε, otherwise negotiate failure；Finally Seller announces Business negotiation result.
2. the method as described in claim 1, which is characterized in that in step 1) in Buyer preparing stateBuyer is right | ψB> implement oracle operation OBIt is converted toAll private information b of assignment in initial statei；Then Buyer is by quantum State | ψ 'B> Seller is sent to by quantum channel.
3. the method as described in claim 1, which is characterized in that in step 2) in seller Seller receiving other side send State and then preparation | the auxiliary particle of 0 > state simultaneously implement Oracle operation OsGenerate state | ψ "BS>:
4. the method as described in claim 1, which is characterized in that in step 3) in Seller grasped using another Oracle Make Of, so that
Wherein
5. the method as described in claim 1, which is characterized in that in step 4) in Seller execute quantum counting algorithm and count Calculate superposition state | ψ " 'BA> in all last two bits be | 10 > quantity, that is, meet bi> siI quantity t.
6. the method as described in claim 1, which is characterized in that in step 5) in Seller and Buyer set a threshold value, And compare t value and threshold value, the price negotiation success if being higher than threshold value is negotiated unsuccessfully to refuse if lower than threshold value It sells, Seller informs Buyer agreed-upon price result.
CN201811172636.9A 2017-12-26 2018-10-09 A kind of safe Business negotiation agreement of two sides based on quantum mechanical Pending CN109272391A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2017114354109 2017-12-26
CN201711435410 2017-12-26

Publications (1)

Publication Number Publication Date
CN109272391A true CN109272391A (en) 2019-01-25

Family

ID=65196165

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811172636.9A Pending CN109272391A (en) 2017-12-26 2018-10-09 A kind of safe Business negotiation agreement of two sides based on quantum mechanical

Country Status (1)

Country Link
CN (1) CN109272391A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109934691A (en) * 2019-02-28 2019-06-25 矩阵元技术（深圳）有限公司 A kind of data processing method of auction, auction client and system
CN113628017A (en) * 2021-08-13 2021-11-09 华北电力大学 Quantum sealed auction method based on quantum public key password

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109934691A (en) * 2019-02-28 2019-06-25 矩阵元技术（深圳）有限公司 A kind of data processing method of auction, auction client and system
CN109934691B (en) * 2019-02-28 2023-08-25 矩阵元技术（深圳）有限公司 Auction data processing method, auction client and system
CN113628017A (en) * 2021-08-13 2021-11-09 华北电力大学 Quantum sealed auction method based on quantum public key password
CN113628017B (en) * 2021-08-13 2023-09-19 华北电力大学 Quantum sealed auction method based on quantum public key cryptography

Similar Documents

Publication Publication Date Title
CN107113179B (en) Method, system, and non-transitory computer-readable storage medium for communication authentication
Yu et al. Privacy-preserving SVM using nonlinear kernels on horizontally partitioned data
CN109657489B (en) Privacy protection set intersection two-party secure calculation method and system
CN110602077B (en) Quantum block chain network anonymous election method based on trust evaluation and storage medium
JP2024020571A (en) Computer-implemented system and method for performing transaction mixing on block chain
CN109314634A (en) Security data exchange
CN101729554B (en) Construction method of division protocol based on cryptology in distributed computation
CN109272391A (en) A kind of safe Business negotiation agreement of two sides based on quantum mechanical
EP3750129B1 (en) System and method for transferring resources using a blockchain
Nagarajan et al. Blockchain single and interval valued neutrosophic graphs
Shi Efficient quantum protocol for private set intersection cardinality
CN111104968A (en) Safety SVM training method based on block chain
Li et al. Ubiquitous intelligent federated learning privacy-preserving scheme under edge computing
Chen et al. Esb-fl: Efficient and secure blockchain-based federated learning with fair payment
Cui A cross-chain protocol based on quantum teleportation for underlying architecture of metaverse
Zhang et al. A privacy protection scheme for bidding users of peer-to-peer electricity call auction trading in microgrids
CN115037439A (en) Multi-party privacy set intersection method and system suitable for small set
Yi A post-quantum blockchain notary scheme for cross-blockchain exchange
Chen et al. Social lending
CN108599923A (en) The implementation method of data efficient safe transmission between cloud computing server
CN106452727A (en) Bit coin transaction transfer method and bit coin transaction transfer system
Han et al. Quantum sealed-bid auction protocol based on semi-honest model
Wang et al. Sealed-bid auction scheme based on blockchain and secure multi-party computation
Liu et al. Multiparty Sealed-Bid auction protocol based on the correlation of Four-Particle entangled state
CN114417389A (en) Method for storing user asset limit through addition homomorphic encryption in block chain

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
WD01 Invention patent application deemed withdrawn after publication
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20190125