CN106714183B - Heterogeneous spectrum allocation method for protecting privacy - Google Patents
Heterogeneous spectrum allocation method for protecting privacy Download PDFInfo
- Publication number
- CN106714183B CN106714183B CN201710045759.5A CN201710045759A CN106714183B CN 106714183 B CN106714183 B CN 106714183B CN 201710045759 A CN201710045759 A CN 201710045759A CN 106714183 B CN106714183 B CN 106714183B
- Authority
- CN
- China
- Prior art keywords
- buyer
- auction
- auctioneer
- information
- encryption
- 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
Links
- 238000001228 spectrum Methods 0.000 title claims abstract description 73
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 22
- 230000006870 function Effects 0.000 claims abstract description 9
- 230000008569 process Effects 0.000 abstract description 10
- 239000003795 chemical substances by application Substances 0.000 description 17
- 230000008901 benefit Effects 0.000 description 8
- 230000007246 mechanism Effects 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 5
- 238000004891 communication Methods 0.000 description 5
- 238000004088 simulation Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 238000012545 processing Methods 0.000 description 3
- 238000011160 research Methods 0.000 description 3
- 239000000654 additive Substances 0.000 description 2
- 230000000996 additive effect Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 2
- 238000012217 deletion Methods 0.000 description 2
- 230000037430 deletion Effects 0.000 description 2
- 238000002474 experimental method Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000006243 chemical reaction Methods 0.000 description 1
- 239000002131 composite material Substances 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000012938 design process Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 230000004043 responsiveness Effects 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
- H04W16/10—Dynamic resource partitioning
-
- 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
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Accounting & Taxation (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a heterogeneous spectrum allocation method for protecting privacy, which comprises the following steps: initializing; submitting a quotation; a safety grouping step: the auctioneer calculates an interference pattern, replaces the interference pattern, doubly encrypts the quotation information and sends the quotation information to the auction agency; the auction agency executes a grouping algorithm, encrypts the replaced buyer identity aiming at each group member, randomizes all double-encryption quotation information, and sends the security operation result of the grouping to the auctioneer; the auctioneer decrypts the outer encryption of the randomized double encrypted offer message; a winner selection step: the auction agent generates an encryption circuit corresponding to the auction algorithm, and the circuit realizes the functions of group pricing and winner selection and sends the functions to the auctioneer; the auctioneer receives the encryption circuit, shares buyer's quotation information and buyer's identity with the auction agency secret, calculates the encryption circuit; and a final pricing step, the invention does not reveal any information about the bid to any participant during the auction process except the outcome of the auction.
Description
Technical Field
The invention relates to the technical field of network and information security, in particular to a heterogeneous spectrum allocation method for protecting privacy based on an encryption circuit and a homomorphic encryption technology.
Background
The wireless spectrum is a limited resource. With the wide application of various wireless communication technologies, people have increasingly growing demands for spectrum resources, and the problem of scarcity of spectrum resources is more and more prominent. The dynamic spectrum auction reallocates the idle frequency band of the original user to a new user for use by means of a proper auction mechanism, improves the utilization efficiency of spectrum resources, further alleviates the problem of spectrum scarcity, and gradually becomes an effective spectrum allocation mode.
Currently, most dynamic spectrum auction mechanisms consider the problem of homogeneous spectrum auction, that is, buyers pay the same price to all frequency bands or form the same interference pattern for all frequency band buyers, which causes the disadvantages of low potential spectrum utility, low buyer satisfaction, and the like.
In order to solve the above problems, a document [ TAMES: a truthfull Auction Mechanism for heterogeneous Spectrum Allocation, 2013] proposes a real Auction Mechanism for heterogeneous Spectrum Allocation, which better solves the heterogeneous Spectrum Allocation problem, and the detailed scheme is as follows:
initializing relevant information of buyers and frequency spectrums aiming at a client host (a buyer requesting frequency spectrum resources), a computing server (an auctioneer providing the frequency spectrum resources and executing an auction mechanism) and an assisting server (a third-party platform realizing non-profit assistance, namely an auction agency); in a network environment formed by all equipment, constructing a corresponding interference graph aiming at each frequency band, searching the largest non-conflicting buyer group in each graph, and matching the corresponding frequency band; the quotation mode of each non-conflicting buyer group is as follows: the price quoted by the buyer is equal to the product of the lowest price quoted in the buyer and the value obtained by subtracting one from the number of the group members; if the group quote is larger than the corresponding frequency band reserve price, the buyer group wins the frequency band use right; except for the one with the lowest bid in the group, the remaining buyers are winners, and each winner's payment is the group's minimum bid.
The simulation result of the scheme proves that compared with a homogeneous quotation and a working medium interference graph, TAMES obtains higher buyer satisfaction and frequency spectrum effectiveness.
In the process of implementing the invention, the inventor finds that: existing heterogeneous spectrum auction mechanisms (e.g., TAMES) do not take into account the issue of buyer privacy protection during the auction process. In a TAMES auction process, where the auctioneer obtains a true valuation of all buyers, a dishonest auctioneer can easily obtain additional benefits by modifying the auction results (e.g., raising the winner's payment). However, the buyer knows the real valuations of other buyers in some way (such as wiretapping), and then in the next same auction, the buyer is likely to manipulate the price of the buyer so as to improve the utility of the buyer and further destroy the integrity of the auction.
Buyer quotation is the important privacy of buyer in heterogeneous spectrum allocation process, and it is necessary to technically realize its privacy protection to avoid its reasonable fair operation that influences heterogeneous spectrum allocation.
Disclosure of Invention
The invention aims to provide a heterogeneous spectrum allocation method for protecting privacy, and the method is used for solving the problem of buyer quotation privacy protection in the existing heterogeneous spectrum auction.
Therefore, the invention provides a heterogeneous spectrum allocation method for protecting privacy, which comprises the following steps: an initialization step: respectively initializing respective basic information by a buyer, an auctioneer and an auction agency; submitting a quote: the buyer uses the auction agency public key to encrypt the quotation information of the frequency spectrum, and the quotation information is sent to the auctioneer in combination with the identity of the buyer; a safety grouping step: the auctioneer calculates an interference pattern, replaces the interference pattern, doubly encrypts the quotation information and sends the quotation information to the auction agency; the auction agency executes a grouping algorithm, encrypts the replaced buyer identity aiming at each group member, randomizes all double-encryption quotation information, and sends the security operation result of the grouping to the auctioneer; the auctioneer decrypts the outer layer encryption of the randomized double-encrypted quotation information, and the buyer identity and the quotation information only relate to the auction agency public key at the moment; a winner selection step: the auction agent generates an encryption circuit corresponding to the auction algorithm, and the circuit realizes the functions of group pricing and winner selection and sends the functions to the auctioneer; the auctioneer receives the encryption circuit, shares buyer quotation information and buyer identity with the auction agency secret, and calculates the encryption circuit; and a final pricing step: and obtaining the winning buyer and the buyer payment price of the frequency spectrum according to the output result of the encryption circuit.
Further, in the initialization step, the buyer initializes own position information and quotation information for each frequency band; the auctioneer initializes the own public and private key pair, the interference threshold value and the reserve price of each frequency band, and informs the auction agent of the public key; the auction agent initializes its own public-private key pair and advertises its public key to the buyer and auctioneer.
Further, in the security grouping step, the auctioneer calculates an interference graph, encrypts the buyer quotation information again by using the public key of the auctioneer, randomly replaces the buyer number in the interference graph, and sends the operation result to the auction agency; the auction agency randomizes all double-encrypted quotation information, encrypts buyer pseudo numbers by using the own public key, executes a heterogeneous spectrum grouping algorithm, and sends a grouping result to the auctioneer, wherein the pseudo numbers are replaced numbers; after receiving the grouping result, the auctioneer uses the private key to decrypt the outer layer encryption of the double-encryption quotation, and the buyer pseudo number and the quotation information in the grouping result are encrypted by using the public key of the auction agency.
Further, in the winner selection step, the auction agent generates an encryption circuit corresponding to an auction algorithm and sends the encryption circuit to the auctioneer; the auction broker receiving circuit is cooperated with the auction broker to execute secret sharing operation of the buyer quotation information and the buyer pseudo code, and further label the information; the auctioneer implements an encryption circuit to enable buyer group quotes and winner selection.
Further, the auctioneer is a computing server, the auction proxy is an assistance server, and the buyer is a plurality of client hosts.
And (3) safety analysis: the heterogeneous spectrum allocation method for protecting privacy provided by the invention realizes the security of cryptography, namely, any information related to quotation except the auction result is not leaked to any participant in the auction process.
Compared with the scheme in the prior art, the invention has the following advantages:
(1) the invention researches the privacy protection problem on the basis of heterogeneous spectrum auction. The existing privacy-protecting spectrum auction work mainly aims at the situation of homogeneous spectrum auction and does not consider the problem of spectrum heterogeneity. The existing heterogeneous spectrum allocation method does not consider the privacy protection problem. The heterogeneity of the spectrum allows privacy protection issues to become more complex and challenging. Aiming at the problems, the invention provides a heterogeneous spectrum allocation method for protecting privacy for the first time.
(2) The invention realizes higher safety. The designed privacy protection method can not only protect the bids of the buyers, namely, not reveal any information about the bids except the auction result, but also protect the identities of the pricing buyers in each winning buyer group, namely, although the auction result publishes the pricing of each winning buyer group as the minimum bid of the group, the buyer corresponding to the minimum bid is still unknown.
Therefore, the method and the device provided by the invention expand the space for the progress of the privacy protection field of the frequency spectrum auction and have a good practical effect.
In addition to the objects, features and advantages described above, other objects, features and advantages of the present invention are also provided. The present invention will be described in further detail below with reference to the drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this application, illustrate embodiments of the invention and, together with the description, serve to explain the invention and not to limit the invention. In the drawings:
fig. 1 is a flow chart of a heterogeneous spectrum allocation method according to the present invention;
FIG. 2 is a functional block diagram illustrating a heterogeneous spectrum allocation method according to the present invention; and
fig. 3a and fig. 3b are schematic diagrams before and after replacing interference maps of 2 frequency bands in a heterogeneous spectrum allocation method according to an assumed embodiment of the present invention, where fig. 3a is a schematic diagram before and after replacing an interference map of a frequency band 1, and fig. 3b is a schematic diagram before and after replacing an interference map of a frequency band 2.
Detailed Description
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present invention will be described in detail below with reference to the embodiments with reference to the attached drawings.
In the present invention, the constructed network environment includes buyers, auctioneers, and auction agencies. The auctioneer sells the frequency spectrum resource to the buyer in an auction mode; the buyer provides service for the user by using the frequency spectrum resources obtained by the auction; the auction broker is responsible for assisting the auctioneer in completing privacy protection of the buyer's information. The auctioneer here may be a computing server; the buyer can be a client host and a server and provides service to the client; the auction agent may be an assistance server.
First, the auctioneer and auction broker cooperate to perform a series of secure interaction operations for buyer grouping, these operations being mainly based on Pallier additive homomorphic encryption System [ Pascal Pallier, "Public-Key cryptosystem based on Composite developer responsiveness Classes", EUROCRYPT' 99 ]; and then an Auction agent generates an encryption circuit corresponding to an Auction algorithm, and an auctioneer executes the encryption circuit, wherein the Auction algorithm is in a document [ TAMES: A Truthful Auction Mechanism for Heterogeneous Spectrum Allocation, 2013], so that the bidding privacy of buyers is effectively protected while the Heterogeneous Spectrum Auction result is calculated.
Referring to fig. 1 and 2 in combination, the heterogeneous spectrum allocation method of the present invention includes the following steps: an initialization step S11, a submit quote step S13, a secure grouping step S15, a winner selection step S17, and a final pricing step S19.
Wherein the initialization step comprises: a buyer initializes own position information and quotation information of each frequency band; the auctioneer initializes the private and public key pair, the interference threshold value and the reserve price of each frequency band, and the auctioning agent of the public key channel; the auction agency initializes its own public-private key pair and channels its public key to the buyer and auctioneer.
Wherein the step of submitting a quote comprises: each buyer encrypts the bid information using the auction agent's public key and sends the encrypted bid information to the auctioneer.
Wherein the step of securely grouping comprises: the auctioneer calculates the interference graph, encrypts the buyer quotation information again by using the public key of the auctioneer, randomly replaces the buyer number in the interference graph and sends the operation result to the auction agency; the auction agency randomizes all double-encrypted quotation information, encrypts buyer pseudo numbers (replaced numbers) by using the own public key, executes a heterogeneous spectrum grouping algorithm, and sends a grouping result to the auctioneer; after receiving the grouping result, the auctioneer uses the private key of the auctioneer to decrypt the outer encryption of the double encryption quotation. So far, the buyer pseudo number and the quotation information in the grouping result are encrypted by using the public key of the auction agency.
Wherein the winner selecting step comprises: the auction agent generates an encryption circuit corresponding to the auction algorithm and sends the encryption circuit to the auctioneer; the auctioneer receiving circuit cooperates with the auction agency to execute secret sharing operation of the buyer quotation information and the buyer pseudo number, and further labels the information, and the auctioneer executes the encryption circuit to realize the quotation of the buyer group and the selection of the winner.
Wherein the final pricing step comprises: for each winning buyer group, except the pricing buyer (the buyer with the lowest price quoted for pricing), the other buyers are winners; the winning set of buyers' lowest bid is the required payment price for each winner in the set of buyers.
The following describes the steps of the heterogeneous spectrum allocation method according to an embodiment of the present invention in detail:
(1) and an initialization step
Consider that in a network environment for performing heterogeneous spectrum auctions, there is one computing server (auctioneer simulation implements a spectrum seller), one helper server (auction broker), and n client hosts (buyers), where the seller has k bands { s } [j1, 2.., k }, each frequency band sjInterference threshold of djCorresponding reserve value of rjEach buyer i (i ═ 1, 2.., n) is required to purchase only one frequency band sj. Let buyer i pair frequency band sjIs quoted as
The bid vector for i can be expressed as:
simultaneously, the position of the memory i is (x)i，yi). In the invention, the public key encryption uses a Paillier homomorphic encryption system, and the company key pairs of the auctioneer and the auction agency are (pk)a，ska) And (pk)b，skb) And the public key is announced to the other side, and authenticated and safe communication channels exist between the user and the auctioneer, and between the auctioneer and the auction agency.
(2) Submitting quotation step
Buyer i (i ═ 1, 2.., n) receives auction agent's public key pkbThen, the encryption algorithm E meeting Paillier semantic security is utilized to encrypt the frequency band sj(j-1, 2.. k) price quote
Grouping encrypted offers for each user i
To the auctioneer.
(3) A step of safe grouping
(3.1) double encryption and permutation
The auctioneer follows the location information (x) of buyer i ( i 1, 2.., n)i，yi) Sum frequency band sjInterference threshold d ofjCalculating to obtain an interference pattern G of each section of frequency spectrumj(j ═ 1, 2,. k); the auctioneer uses his own public key pkaAnd encrypting the buyer's offer information again:
to obtain
Then all interference patterns pi (G) are replacedj) ( j 1, 2.. k.) so that the buyer number in the interference map is replaced by a pseudo number i from the original i*(ii) a Finally, the auctioneer encrypts the double-encrypted quotation information (i) of all buyers*，βi) And (i ═ 1, 2.., n) and the permuted interference pattern are sent to the auction agency.
(3.2) grouping and processing
After receiving the information from the auctioneer, the auction agency executes a buyer grouping algorithm aiming at heterogeneous spectrum allocation, and the buyer grouping algorithm is executed in a frequency band s1Corresponding interference pattern G1In, find the largest non-conflicting group g1(ii) a In frequency band s2Corresponding interference pattern G2Wherein deletion is contained in g1Obtaining interference graph G 'of all buyers in'2And in G'2Finding the maximum non-conflicting group g2(ii) a And so on until in frequency band skCorresponding interference pattern GkWherein deletion is contained in g1，g2，...，gk-1Obtaining interference graph G 'of all buyers in'kAnd in G'kMiddle searching maximum non-conflict buyer group gk. And finally obtaining a buyer group set G (G)1，g2，...，gk) Satisfy the requirement of
For buyer group gjThe pseudo number in (1 is more than or equal to j and less than or equal to k) is i*Buyer of (2) using public key pkbEncrypted buyer pseudo-number i*To obtain
And randomize its double encrypted quote
To obtain
(3.3) obtaining packet information
After the auctioneer receives the message, it is goodUsing its own private key skaThe result of decrypting the previously randomized double encrypted quote information:
at this time, the pseudo number and the encrypted offer information of each buyer are combined into
Involving only the public key pk of the auction agencybWhere "+ 0" denotes the randomization process.
The benefits of the randomization operation described above are: if no randomization is performed, the auction broker sends the buyer information directly
For the auctioneer, the auctioneer can use his own private key skaOuter layer encryption of decrypted double encrypted quote information
Can be matched with the original information
By comparison, tau is deduced from the same encrypted quoteiThe corresponding true number is i.
The advantages of adopting the buyer grouping algorithm are as follows: in each frequency band sj(j ═ 1, 2.. times, k) corresponding interference map GjDeleting the grouped buyers, and searching the maximum conflict-free buyer group g in the formed interference graphjAnd g isjAnd adding the new buyer group into the formed buyer group set. Any two buyers in the generated buyer group can share the same frequency band without mutual interference, and the spatial multiplexing of the frequency spectrum is realized.
(4) And the step of winner selection
(4.1) encryption Circuit
The auction agent generates an encryption circuit corresponding to the auction algorithm. The encryption circuit is composed of basic circuits such as an adder circuit, a multiplier circuit, and a comparator circuit, and refer toDocument [ Improved Garbled Circuit Building blocks and Applications to Automation and Computing Minima, 2009]And respectively realize that: restoring original quote information
And buyer pseudo number i*The label of (1); calculating offers of non-conflicting buyer groupsjThe label of (1); calculating the frequency band sjPseudo number of winner i*And the price paid by the winner
(4.2) input tag calculation
To encrypt the input information (including the pseudo-numbers and offers of all buyers in the group of all buyers), the auctioneer and the auction broker first need to collaborate for secret sharing of the input information: for any buyer i in any buyer group, the auctioneer randomly selects a message r1And r2Using the auction agency's public key pkbRespectively calculate
Transmitting using the property of the addition homomorphic encryption algorithm E (a) xE (b) E (a + b)
And
to the auction agency, the auction agency receives
And
then use its own private key skbDecrypting the received encrypted message to obtain i*-r1And
to this end, realize buyingSecret sharing of information of the auctioneer i between the auctioneer and the auction broker, i.e. the share of the auctioneer is (r) for each buyer information1，r2) And the auction agent's share is
Next, the auctioneer and the auction broker perform tagging according to the secret shared information: the auction agency transmits the information of each buyer i to the corresponding share
Labeling, sending to the auctioneer, and the auctioneer receiving the label of the buyer i information and the share (r) corresponding to the buyer information1，r2) The pseudo number and the quotation of the buyer i can be obtained by calculation through an addition circuit
A corresponding label. As to the reserve valence rj(j ═ 1, 2.. times, k), since it is the information provided by the auctioneer, it can be input to the encryption circuit in the form of a constant term.
(4.3) encryption Circuit calculation
Once the tag entries required by the encryption circuit are ready, the auctioneer may execute the encryption circuit. The encryption circuit mainly realizes two functions: buyer group pricing and winner determination. The buyer group pricing is realized according to the following steps:
when the buyer group g does not conflict with each otherjGroup quote of phij＞rjThen, the buyer group is the winning buyer group. Each winning buyer group gjThe other buyers except the pricing buyer are the winners, and the winners win the frequency band sjThe right of use. The encryption circuit ultimately returns all winning buyer groups, the pseudo-number set of winning buyers in each winning buyer group and the lowest bid price for each winning buyer group. Finally, the auctioneer assigns a pseudo-number i to each winning buyer i*According to the above-mentioned replacement changeAnd (6) changing pi and recovering to the real serial number i.
(5) Final pricing step
The union of the winning buyers in all the winning buyer groups, each g, is the winner set of the auctionjWinning buyer in the game, winning the frequency band s corresponding to the buyer groupjAnd paying the minimum price of the group
The heterogeneous spectrum allocation method of the embodiment has the following advantages:
(1) the invention researches the privacy protection problem on the basis of heterogeneous spectrum auction. The existing privacy-protecting spectrum auction work mainly aims at the situation of homogeneous spectrum auction and does not consider the problem of spectrum heterogeneity. The existing heterogeneous spectrum auction scheme does not consider the problem of protecting privacy. The heterogeneity of the spectrum allows privacy protection issues to become more complex and challenging. In order to solve the problems, a heterogeneous spectrum auction scheme for protecting privacy is provided for the first time.
(2) The method organically combines three security technologies, namely homomorphic encryption, an encryption circuit and secret sharing, achieves privacy protection in heterogeneous spectrum auction, and meanwhile well controls execution efficiency of a security scheme, so that the scheme is more practical.
(3) The present invention provides several novel design techniques in the design process. Randomizing the double encrypted offer, such as using a Paillier encryption system, which has not been seen in the prior literature; ciphertext encrypted by the Paillier system is converted into a label of an encryption circuit through an additive secret sharing technology, so that the ciphertext does not need to be transmitted at a loss, and the ciphertext is not found in the existing research.
(4) The invention realizes higher safety. The privacy protection scheme is designed to protect not only the bids of the buyers, i.e. not reveal any information about the bids except the auction result, but also the identities of the pricing buyers in each winning buyer group, i.e. although the auction result publishes the pricing of each winning buyer group as the minimum bid of the group, the buyer corresponding to the minimum bid is still unknown.
The heterogeneous spectrum allocation method according to the present invention is described below by taking 1 assisting server and 5 client hosts as examples, and with reference to fig. 1, fig. 2, fig. 3a and fig. 3b, the method includes the following processes:
(1) initialization step
The 5 client hosts respectively identify 5 buyer identities according to host sequence numbers 1, 2, 3, 4 and 5, coordinates (0,70), (50, 70), (110, 35), (0, 0) and (50,0) are randomly generated, and the position information of the 5 buyers is respectively identified. The 1 computation server identifies one seller, and the seller has 2 frequency bands, so that the computation server sets frequency band interference thresholds to be 80 and 60 respectively, and corresponding reserve prices to be 4 and 3 respectively. The valuation range of the buyers is between 0 and 10, and 5 buyers are respectively provided with (9,6), (5,4), (7,6), (6,2) and (4,5) valuations of 2 frequency bands. For simplicity, the following description will be described with reference to the buyer, auctioneer and auction agency, and the public-private key pairs of the auctioneer and auction agency are labeled as (pk) respectivelya，ska) And (pk)b，skb) And simultaneously, the public keys of the two public keys are mutually announced.
(2) Submitting a quote step
Each buyer encrypts its own bid information using the auction agency's public key and then submits the information to the auctioneer in the format of:
containing the buyer number and the encrypted quote information. For example, buyer 1 submissions
To the auctioneer, here 1 is the buyer number.
(3) Step of secure grouping
(3.1) auctioneer: double encryption and permutation
The auctioneer judges whether any two buyers interfere with each other according to a distance formula, and calculates the original interference graphs of the two frequency bands. The auctioneer then uses his or her ownPublic key pkaAnd doubly encrypting the quotation information to obtain the buyer number and the doubly encrypted quotation information thereof:
the auctioneer then employs the following random permutation rule
And (3) replacing to generate a buyer pseudo number, and obtaining the buyer pseudo number and the double-encrypted quotation information form as follows:
and finally, the auctioneer sends the operation result and the replaced interference graph to the auction agency. Note that: after the auction agency receives these messages, neither the true number of each node nor their bid information is known, so the auction agency then proceeds to "blind" grouping.
(3.2) auction agency: grouping and processing
The auction agency obtains the non-conflict buyer groups of 2 frequency bands g according to the searching algorithm of the maximum non-conflict buyer groups 14, 3 and g 25, 2. The auction broker then processes the buyer information in the two buyer groups, i.e. using its own public key pkbEncrypting the pseudo-number and randomizing the doubly encrypted quote information to obtain g1And g2The processed packet information is respectively as follows:
the auction agent sends the above processed packet information to the auctioneer. Note that "+ 0" here indicates that the randomization operation is performed.
(3.3) auctioneer: obtaining packet information
After receiving the processed grouping information, the auctioneer uses the private key sk thereofaDecrypting the randomized double encrypted bid information to obtain the auction proxy public key pkbEncrypted packet information of (1):
(4) winner selection step
(4.1) encryption Circuit
The auction agent generates an encryption circuit corresponding to the auction algorithm and sends the encryption circuit to the auctioneer.
(4.2) input tag calculation
The auctioneer and auction proxy then cooperate to complete the secret sharing of the grouped information. Let us assume that secret sharing conversion is performed by selecting a specific random number, and the share of the grouped information shared by the auctioneers is obtained as follows:
g1：{(3，2)，(5，3)}，
g2：{(9，6)，(-9，12)}
and the auction agent's share is:
g1：{(1，7)，(-2，1)}，
g2：{(-4，-2)，(11，-10)}
assuming G (.) is a tagging function, the auction agent tags its share to obtain:
g1：{(G(1)，G(7))，(G(-2)，G(1))}，
g2：{(G(-4)，G(-2))，(G(11)，G(-10))}
the auction agent sends the self-tagged shares to the auctioneer, and the auctioneer listens the tagged shares and the self-corresponding shares to an adding circuit for addition, such as g1The first buyer of the group can be calculated as G (4) ═ G (1) +3, G (9) ═ G (7) +2, and finally the result is obtainedThe input labels to the packet information are:
g1：{(G(4)，G(9))，(G(3)，G(4))}，
g2：{(G(5)，G(4))，(G(2)，G(2))}，
in addition, the reserve value r14 and r2Since the information is known to the auctioneer, 3 can be input to the encryption circuit as a constant term.
(4.3) encryption Circuit calculation
Once the tag entries required by the encryption circuit are ready, the auctioneer may implement the encryption circuit by first, according to a buyer group quotation formula
Computing
Φ1＝G(4)×(2-1)＝G(4)
Φ2＝G(2)×(2-1)＝G(2)
Secondly, whether the buyer group wins is judged through a comparison circuit. Due to phi1＝G(4)≥r1＝4，Φ2＝G(2)＜r2G is equal to 31For winning buyer group, and g2Not. Finally, the encryption circuit returns g1The buyer with the pseudo number 4 is the winner, wins the frequency band s1Group g1The minimum bid is 4.
(5) Final pricing step
According to (4.3), buyer group g1Gain the use right of the frequency band because of having
The true number of the final winning buyer is 1 and the required payment price is 4.
Simulation analysis
The following is a specific implementation of the method.
Our simulation experiments are based on FastGC, a circuit library function written in the Java language that can construct cryptographic circuits. In the experiment, two processes, namely server and client, are adopted to simulate an auctioneer and an auction agency, and the two parties are in windows1064-bit operating system, Intel CoreTMThe steps of the invention are executed on a platform of i5-45903.30GHz processor and 16GB memory.
During the experiment, some parameters were set as follows:
we assume that all buyers are randomly distributed in a 100m by 100m area, the interference threshold of each spectrum is uniformly selected between 20-80 m, the buyer quotation and the reserve price of the spectrum are randomly selected in integers [1..50] and [1..150], respectively, and the default length of all the numbers is 16 bits. Tables 1 and 2 are given, where the data are the average results of ten runs of the simulation experiment.
Table 1 shows a running time comparison table of PATH and TAMES, in table 1, the fixed spectrum number K is 120, n (number of buyers) is uniformly changed from 400 to 2400, and the running times of our encryption scheme PATH and unencrypted scheme TAMES are tested. For the convenience of statistics, the operation of rounding the test result is adopted, and as can be seen from the comparison of the running time cost of the two schemes in the table 1, the scheme can be selected in practical application and has high practical value.
Table 1:
table 2 shows a running time and communication cost table of the PATH, in table 2, the fixed spectrum number K is 100, n (the number of buyers) is uniformly changed from 1000 to 8000, and the costs of the encryption scheme PATH in the running time and the communication cost are tested on the premise of large data, in table 2, n is 9.5446min in the running time of 8000 and the communication cost is 116.2225mb, so that the scheme can perform spectrum auction for processing a large amount of data in batch, and has the advantages of high running speed and high distribution efficiency. Safe and reliable lamp characteristics.
Table 2:
the above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (2)
1. A heterogeneous spectrum allocation method for protecting privacy is characterized by comprising the following steps:
an initialization step: respectively initializing respective basic information by a buyer, an auctioneer and an auction agency;
submitting a quote: the buyer uses the auction agency public key to encrypt the quotation information of the frequency spectrum, and the quotation information is sent to the auctioneer in combination with the identity of the buyer;
a safety grouping step: the auctioneer calculates an interference pattern, replaces the interference pattern, doubly encrypts the quotation information and sends the quotation information to the auction agency; the auction agency executes a grouping algorithm, encrypts the replaced buyer identity aiming at each group member, randomizes all double-encryption quotation information, and sends the security operation result of the grouping to the auctioneer; the auctioneer decrypts the outer layer encryption of the randomized double-encrypted quotation information, and the buyer identity and the quotation information only relate to the auction agency public key at the moment;
a winner selection step: the auction agent generates an encryption circuit corresponding to the auction algorithm, and the circuit realizes the functions of group pricing and winner selection and sends the functions to the auctioneer; the auctioneer receives the encryption circuit, shares buyer quotation information and buyer identity with the auction agency secret, and calculates the encryption circuit; and
and a final pricing step: obtaining winning buyers and buyer payment prices of the frequency spectrum according to the output result of the encryption circuit,
in the initialization step, the buyer initializes own position information and quotation information of each frequency band; the auctioneer initializes the own public and private key pair, the interference threshold value and the reserve price of each frequency band, and informs the auction agent of the public key; the auction agent initializes its own public-private key pair and advertises its public key to the buyer and auctioneer,
in the security grouping step, the auctioneer calculates an interference graph, encrypts buyer quotation information again by using a public key of the auctioneer, randomly replaces buyer numbers in the interference graph, and sends the operation result to an auction agency; the auction agency randomizes all the double-encrypted quotation information, encrypts a buyer pseudo number by using a public key of the auction agency, executes a grouping algorithm, and sends a grouping result to the auctioneer, wherein the pseudo number is a replaced number; after receiving the grouping result, the auctioneer uses the private key to decrypt the outer layer encryption of the double-encryption quotation, the buyer pseudo number and the quotation information in the grouping result are encrypted by the public key of the auction agency,
in the winner selection step, the auction agent generates an encryption circuit corresponding to an auction algorithm and sends the encryption circuit to the auctioneer; the auction broker receiving circuit is cooperated with the auction broker to execute secret sharing operation of the buyer quotation information and the buyer pseudo code, and further label the information; the auctioneer implements an encryption circuit to enable buyer group bidding and winner selection,
in the final pricing step, for each winning buyer group, except the pricing buyer, the other buyers are winners; the lowest bid price of the winning buyer group is the payment price required by each winner in the buyer group, wherein the pricing seller is the buyer with the lowest bid price to be sacrificed for pricing.
2. The privacy-preserving heterogeneous spectrum allocation method according to claim 1, wherein the auctioneer is a computing server, the auction agency is an assistance server, and the buyers are multiple client hosts.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710045759.5A CN106714183B (en) | 2017-01-20 | 2017-01-20 | Heterogeneous spectrum allocation method for protecting privacy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710045759.5A CN106714183B (en) | 2017-01-20 | 2017-01-20 | Heterogeneous spectrum allocation method for protecting privacy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106714183A CN106714183A (en) | 2017-05-24 |
| CN106714183B true CN106714183B (en) | 2020-05-15 |
Family
ID=58909463
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710045759.5A Active CN106714183B (en) | 2017-01-20 | 2017-01-20 | Heterogeneous spectrum allocation method for protecting privacy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106714183B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107241806B (en) * | 2017-07-14 | 2018-07-31 | 安徽大学 | Auction and privacy protection based bidirectional heterogeneous spectrum allocation method |
| CN109033865B (en) * | 2018-06-20 | 2021-10-01 | 苏州大学 | Task allocation method for privacy protection in space crowdsourcing |
| CN109756981B (en) * | 2019-01-22 | 2023-10-13 | 北京电子工程总体研究所 | Battlefield wireless spectrum resource allocation method and system based on auction mechanism |
| CN110460440B (en) * | 2019-08-23 | 2021-12-07 | 安徽大学 | Dynamic virtual machine allocation method based on combined cloud auction mechanism and privacy protection |
| CN111954220B (en) * | 2020-08-21 | 2022-09-30 | 安徽大学 | One-way heterogeneous spectrum allocation method based on differential privacy protection |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105468986A (en) * | 2015-12-02 | 2016-04-06 | 深圳大学 | Confidential information retrieval method and system |
| CN105577257A (en) * | 2014-10-31 | 2016-05-11 | 天工方案公司 | Diversity Receiver Front End System With Impedance Matching Components |
-
2017
- 2017-01-20 CN CN201710045759.5A patent/CN106714183B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105577257A (en) * | 2014-10-31 | 2016-05-11 | 天工方案公司 | Diversity Receiver Front End System With Impedance Matching Components |
| CN105468986A (en) * | 2015-12-02 | 2016-04-06 | 深圳大学 | Confidential information retrieval method and system |
Non-Patent Citations (4)
| Title |
|---|
| A Privacy Preserving Truthful Spectrum Auction Scheme using Homomorphic Encryption;Xiaoyan Wang等;《IEEE》;20151231;第I-III节 * |
| A Proof of Security of Yao’s Protocol for Two-Party Computation;Yehuda Lindell等;《Journal of CRYPTOLOGY》;20081231;第170-174页 * |
| TAMES: A Truthful Auction Mechanism for Heterogeneous Spectrum Allocation;Yanjiao Chen等;《IEEE》;20131231;全文 * |
| 面向车载自组网的高效位置隐私保护查询方案;郭松矗等;《计算机工程》;20140630;第40卷(第6期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106714183A (en) | 2017-05-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106714183B (en) | Heterogeneous spectrum allocation method for protecting privacy | |
| CN107392743B (en) | McAfe two-way auction privacy protection method and auction method | |
| Choi et al. | Secure multi-party computation of boolean circuits with applications to privacy in on-line marketplaces | |
| Bogetoft et al. | A practical implementation of secure auctions based on multiparty integer computation | |
| US6834272B1 (en) | Privacy preserving negotiation and computation | |
| Wang et al. | Privacy-preserving and truthful double auction for heterogeneous spectrum | |
| CN106161415B (en) | A kind of information processing method and mobile gunz perception application platform | |
| Chen et al. | ARMOR: A secure combinatorial auction for heterogeneous spectrum | |
| Sun et al. | Privacy-preserving verifiable incentive mechanism for online crowdsourcing markets | |
| JP2019061233A (en) | System and method for safe two-party evaluation for usefulness of sharing data | |
| CN107241806B (en) | Auction and privacy protection based bidirectional heterogeneous spectrum allocation method | |
| CN111586142A (en) | Safe multi-party computing method and system | |
| Li et al. | Secure multi‐unit sealed first‐price auction mechanisms | |
| Chen et al. | ITSEC: An information-theoretically secure framework for truthful spectrum auctions | |
| Chen et al. | Privacy-preserving spectrum auction design: challenges, solutions, and research directions | |
| Larson et al. | A bidder-oriented privacy-preserving vcg auction scheme | |
| JP4883619B2 (en) | Secret sharing information processing system | |
| Wang et al. | Quantum sealed-bid auction protocol based on quantum secret sharing | |
| Wu et al. | A secure quantum sealed-bid auction protocol based on quantum public key encryption | |
| Jung et al. | Enabling privacy-preserving auctions in big data | |
| Liu et al. | Multiparty Sealed-Bid auction protocol based on the correlation of Four-Particle entangled state | |
| Wang et al. | Secure double auction protocols with full privacy protection | |
| Yu et al. | Smart communications in heterogeneous spacecraft networks: A blockchain based secure auction approach | |
| Prihandoko et al. | Stream-keys generation based on graph labeling for strengthening Vigenere encryption. | |
| Omote et al. | An anonymous sealed-bid auction with a feature of entertainment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |