CN109003172A - Protect the space crowdsourcing task auction bidding method of privacy - Google Patents
Protect the space crowdsourcing task auction bidding method of privacy Download PDFInfo
- Publication number
- CN109003172A CN109003172A CN201810742158.4A CN201810742158A CN109003172A CN 109003172 A CN109003172 A CN 109003172A CN 201810742158 A CN201810742158 A CN 201810742158A CN 109003172 A CN109003172 A CN 109003172A
- Authority
- CN
- China
- Prior art keywords
- task
- worker
- platform
- auction
- winning bidder
- 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
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
-
- 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
- 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/62—Protecting access to data via a platform, e.g. using keys or access control rules
- G06F21/6218—Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
- G06F21/6245—Protecting personal data, e.g. for financial or medical purposes
-
- 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
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06311—Scheduling, planning or task assignment for a person or group
Abstract
The invention discloses a kind of space crowdsourcing task auction bidding methods for protecting privacy; it include: according to requestor's mission bit stream submitted and the status information of worker's submission based on the execution task distribution of reverse auction process; winning bidder's select permeability form in auction process is turned into the n:1 with the limitation of multiple 0-1 knapsacks and weights Bipartite Matching problem; by the corresponding payoff of optimum auction theoretical calculation winning bidder, the payoff is wherein target critical value；It the use of homomorphic cryptography technology is the privacy information that crowdsourcing system in space generates that encryption code key protects worker by introducing one and half honest third parties when completing task assignment procedure.Emulative task distribution is realized, improves the effectiveness of space crowdsourcing system, and ensure that the privacy information of worker does not leak, excitation worker plays an active part in into space crowdsourcing system.With good advanced and practicability.
Description
Technical field
The invention belongs to space crowdsourcing system tasks to distribute field, pass through joint consideration worker's more particularly to a kind of
The space crowdsourcing task auction bidding method of competitive and secret protection protection privacy.
Background technique
In recent years, with the fast development of intelligent movable equipment and wireless network, a kind of worker needs to be moved to specified
The new crowdsourcing form that task is completed in position has already appeared, referred to as space crowdsourcing (spatial crowdsourcing).One
Typical space crowdsourcing system is made of a group worker and a cloud platform that can issue each space-like crowdsourcing task.Due to
Space crowdsourcing can complete the task that a large amount of individual consumer cannot be handled, therefore have stimulated the hair of some business applications
Exhibition, such as: Gigwalk, Waze, Uber etc..
In the crowdsourcing of space, important studying a question is how task to be distributed to suitable worker.According to
Underlying task release model, the existing solution to study a question are divided into two classes, and one kind is that worker selects task,
Another kind of is server distribution task.In the case where worker selects mission mode, worker can select to appoint according to the preference of oneself
The task of meaning, this cannot be guaranteed it is consistent with the purpose of crowdsourcing platform, for example, the purpose when platform is maximized and is all completed
When task quantity.In the case where server distributes mission mode, this problem can pass through access work by very good solution, crowdsourcing platform
The information of author can distribute to task suitable worker, to realize the purpose of oneself.Although both modes have
Respectively suitable application, but they all do not account for really competing between worker in crowdsourcing application.If can be very
This competition is explored well, it will bigger effectiveness is brought to crowdsourcing platform.Meanwhile in space crowdsourcing system, platform passes through
Smart phone, which obtains extensive work person, will will lead to the leakage of worker's sensitive information to the quotation information of task, seriously threaten work
The personal secrets of author.Therefore, the privacy information of worker is protected to be very important.Task distribution for space crowdsourcing is asked
Topic lacks while considering the correlative study of worker's competitiveness and secret protection.Therefore, in order to solve above mentioned ask
Topic, a kind of method for finding consideration worker competitiveness and secret protection are very urgent.The competitiveness of worker is considered simultaneously
And secret protection, the sensitive information of worker can not only be protected, moreover it is possible to motivate their participation task distribution, also ensure simultaneously
The honest quotation of worker's energy, has advanced and practicability well.
Summary of the invention
For the above technical problems, object of the present invention is to: provide it is a kind of protect privacy space crowdsourcing task
Auction bidding method realizes emulative task distribution, improves the effectiveness of space crowdsourcing system, and ensure that the privacy of worker
Information does not leak, and excitation worker plays an active part in into space crowdsourcing system.With good advanced and practicability.
The technical scheme is that
A kind of space crowdsourcing task auction bidding method for protecting privacy, comprising the following steps:
S01: the mission bit stream submitted according to requestor and the status information of worker's submission are based on reverse auction process and hold
Winning bidder's select permeability form in auction process is turned to the n:1 weighting two with the limitation of multiple 0-1 knapsacks by the distribution of row task
Portion's figure matching problem, by the corresponding payoff of optimum auction theoretical calculation winning bidder, the payoff is that wherein target is critical
Value；
S02: when completing task assignment procedure, by introducing one and half honest third parties, using homomorphic cryptography technology to life
At the privacy information of worker encrypt.
In preferred technical solution, crowdsourcing service requester submits task sj=< lj,Tj,aj,ej>, wherein ljBe need by
The task s of completionjTwo-dimensional spatial location, TjExpression task sjEffective time range, ajIt is task sjType, ejIt is request
Person is supplied to completion task sjWorker remuneration.
In preferred technical solution, the status information u of workeri=< Li,Ai,ti,vi,δi>, LiIt is orderly by one group
The worker u that crossbar contact indicatesiTrip route, AiIt is worker uiThe task type set being capable of handling, tiIt is trip
Initial time, viIt is average travel speed, δiIt is worker uiThe maximum for the task of completing that can detour is around row distance.
In preferred technical solution, task distribution, including following step are executed based on reverse auction process in the step S01
It is rapid:
Platform issues all task S and gives all working person U, each worker uiExecuting task sjWhen can pay it is certain
Cost, each worker submit a quotation b to platformijAs compensation, platform completes winning bidder's selection course and is equivalent to obtain
System optimization target, system optimization target are as follows:
Maximize:
Subject to:
Wherein, dijExpression worker uiCompletion task sjNeed the additional distance to detour from original path, xij=1 indicates the
J task is assigned to i-th of worker, is otherwise not yet assigned to the worker, and requires each task that can only be worked by one
Person completes, and distributes to the accumulative maximum around row distance no more than the worker for the task that each worker completes around line-spacing
From；If worker uiQuotation b is used in auctionijWin task sj, i.e. xij=1, which is referred to as when front-wheel is auctioned
One of winning bidder；Finally, it is that each winning bidder calculates corresponding payment p that platform, which is based on Myerson optimum auction theory,ij。
In preferred technical solution, the step S02 includes:
Worker encrypts bid information using public key, and encrypted bid information is sent to platform；Platform
Construction weighting bigraph (bipartite graph), weight are equal to task sjSupplier be ready that the reward of payment subtracts the bid b of workerij, then put down
Platform sends encrypted side right to third party；Half honest third party decrypts weight using private key and is ranked up, then will sequence
Weight afterwards again encrypting and transmitting to platform；Platform is based on encryption weight and executes task distribution and payment calculating process, obtains
Winning bidder's set and the encryption payoff to winning bidder, and third party is sent them to, it is got paid by third party's decryption
To the payoff of winning bidder.
The invention also includes it is a kind of protect privacy space crowdsourcing task auction bidding system, including be set to cloud platform,
Worker end and half honest third square end；
The platform: the mission bit stream submitted according to requestor and the status information of worker's submission are based on reverse auction
Winning bidder's select permeability form in auction process is turned to the n:1 with the limitation of multiple 0-1 knapsacks and added by the distribution of Cheng Zhihang task
Bipartite Matching problem is weighed, by the corresponding payoff of optimum auction theoretical calculation winning bidder, the payoff is wherein target
Critical value；
The status information of itself is sent to platform by the worker end, according to the mission bit stream issued on platform, in conjunction with
The restrictive condition of itself, submits a tender to task；
Half honest third square end, when completing task assignment procedure, using homomorphic cryptography technology to the hidden of the worker of generation
Personal letter breath is encrypted.
In preferred technical solution, crowdsourcing service requester submits task sj=< lj,Tj,aj,ej>, wherein ljBe need by
The task s of completionjTwo-dimensional spatial location, TjExpression task sjEffective time range, ajIt is task sjType, ejIt is request
Person is supplied to completion task sjWorker remuneration.
In preferred technical solution, the status information u of workeri=< Li,Ai,ti,vi,δi>, LiIt is orderly by one group
The worker u that crossbar contact indicatesiTrip route, AiIt is worker uiThe task type set being capable of handling, tiIt is trip
Initial time, viIt is average travel speed, δiIt is worker uiThe maximum for the task of completing that can detour is around row distance.
It is described that task distribution is executed based on reverse auction process in preferred technical solution, comprising the following steps:
Platform issues all task S and gives all working person U, each worker uiExecuting task sjWhen can pay it is certain
Cost, each worker submit a quotation b to platformijAs compensation, platform completes winning bidder's selection course and is equivalent to obtain
System optimization target, system optimization target are as follows:
Maximize:
Subject to:
Wherein, dijExpression worker uiCompletion task sjNeed the additional distance to detour from original path, xij=1 indicates the
J task is assigned to i-th of worker, is otherwise not yet assigned to the worker, and requires each task that can only be worked by one
Person completes, and distributes to the accumulative maximum around row distance no more than the worker for the task that each worker completes around line-spacing
From；If worker uiQuotation b is used in auctionijWin task sj, i.e. xij=1, which is referred to as when front-wheel is auctioned
One of winning bidder；Finally, it is that each winning bidder calculates corresponding payment p that platform, which is based on Myerson optimum auction theory,ij。
In preferred technical solution, worker encrypts bid information using public key, and encrypted bid is believed
Breath is sent to platform；Platform architecture weights bigraph (bipartite graph), and weight is equal to task sjSupplier be ready payment reward subtract work
The bid b of personij, then platform sends encrypted side right to third party；Half honest third party is gone forward side by side using private key decryption weight
Row sequence, then by the weight after sequence again encrypting and transmitting to platform；Platform be based on encryption weight execute task distribution and
Calculating process is paid, winning bidder's set and the encryption payoff to winning bidder is obtained, and sends them to third party, by the
Tripartite's decryption is got paid to the payoff of winning bidder.
Compared with prior art, the invention has the advantages that
(1) it is different from Traditional Space crowdsourcing task distribution system, the present invention provides a kind of space crowdsourcings for protecting privacy
Task auction bidding method, by using in Myerson optimum auction theory winning bidder's selection mechanism and payments mechanism appoint
Business distribution and payment calculate, meanwhile, it is protected using privacy information of the homomorphic cryptography technology to worker, combines and consider work
The competitiveness and secret protection of author has advanced and practicability well.
(2) present invention considers a kind of novel task distribution, is known as the task distribution that detours, under such setting, often
One worker has the track from origin-to-destination, and need to detour task of completing, and meets very much actual scene.
(3) the space crowdsourcing task auction bidding method of protection privacy proposed by the present invention is effectively guaranteed in Game Theory
The critical natures such as honesty and individual rationality, realize the maximization of social welfare, and worker has effectively been motivated to participate in taking office
Among business distribution.
Detailed description of the invention
The invention will be further described with reference to the accompanying drawings and embodiments:
Fig. 1 is the flow chart of the space crowdsourcing task auction bidding method of present invention protection privacy；
Fig. 2 is the secret protection reverse auction illustraton of model of a preferred embodiment of the present invention.
Specific embodiment:
Above scheme is described further below in conjunction with specific embodiment.It should be understood that these embodiments are for illustrating
The present invention and be not limited to limit the scope of the invention.Implementation condition used in the examples can be done according to the condition of specific producer
Further adjustment, the implementation condition being not specified is usually the condition in routine experiment.
Embodiment:
As shown in Figure 1, a kind of space crowdsourcing task auction bidding method for protecting privacy, comprising the following steps:
(1) crowdsourcing service requester submits task and mission bit stream gives crowdsourcing platform, and the person of working at the same time submits status information
Give crowdsourcing platform.
(2) status information that the mission bit stream and worker that platform is submitted according to requestor are submitted is based on reverse auction process
The distribution of execution task.Firstly, platform, which issues all task S, gives all working person U, each worker uiExecuting task sjShi Hui
Certain cost is paid, for this purpose, he submits a quotation b to platformijAs compensation.Then, system optimization object definition are as follows:
Maximize:
Subject to:
Wherein dijExpression worker uiCompletion task sjNeed the additional distance to detour from original path, xij=1 indicates jth
A task is assigned to i-th of worker, is otherwise not yet assigned to the worker, and requires each task can only be by a worker
It completes, distributes to the accumulative maximum around row distance no more than the worker for the task that each worker completes around row distance.
(3) platform executes task assignment procedure after optimization aim has been determined, entire assigning process is based on weighting two
Figure, side right are task sjSupplier be ready that the reward of payment subtracts the bid b of workerij.The weighting bigraph (bipartite graph) constructed herein,
When every wheel auction operation, winning bidder's selection mechanism selects weight maximum while as final matching for successively greed, until
Having a mid-side node in bigraph (bipartite graph), all processing terminate, and the final matching side chosen is all matching results, retains and defeated
This matching result out.
(4) during (3), after obtaining all tasks and the matching result set of worker, the remuneration of winning bidder is determined.
Specific implementation procedure are as follows: remove certain matching side in current matching results set, corresponding side right is wij, then execute primary acceptance of the bid
Person's selection mechanism, i.e. step (3) then stop selection mechanism when encountering any one in following two situation: 1) task sjHerein
Other worker u are given in matching in secondary selection resulti', 2) or worker uiMatching task sj' after, it is remaining to expire around row distance
Sufficient task sj.It is winning bidder b based on thisijCalculate payment pij。
(5) space crowdsourcing utilizes the privacy information of homomorphic cryptography technical protection worker using half honest third party.Homomorphism
Encryption mechanism meets:Wherein M1, M2 ∈ Zq are two cleartext informations, and E [] is same
State cryptographic operation.Formula shows that this two information phases can be directly obtained when being multiplied with the homomorphic cryptography ciphertext of two information
The ciphertext added.Worker encrypts bid using public key, and encrypted bid is sent to platform；Platform architecture weighting
Bigraph (bipartite graph), supplier of the weight equal to task sj are ready that the reward of payment subtracts the bid bij of worker, and then platform is to third
Side sends encrypted side right；Half honest third party decrypts weight using private key and is ranked up, then by the weight after sequence
Encrypting and transmitting is to platform again.Platform is based on encryption weight and executes task distribution and payment calculating process, obtains winning bidder's collection
Close and to these winning bidders encryption payoff, and send them to third party, got paid in by third party's decryption
The payoff of mark person.
In order to illustrate present system, the present embodiment has used model as shown in Figure 2.Implementation steps are as follows:
(1) platform issues all task S and gives all working person U；
(2) each worker uiExecuting task sjWhen can pay certain cost, for this purpose, he to platform submit one report
Valence bijAs compensation.
(3) Task Allocation Problem is abstracted as reverse auction problem by platform, and then the auction problem is turned to by form and has
The n:1 cum rights Bipartite Matching problem of multiple 0-1 knapsacks limitation, it was demonstrated that it is that NP is difficult to resolve, therefore the approximation for using greedy plan to cough up
Algorithm determines winning bidder, and is that each winning bidder calculates payoff based on Myerson optimum auction theory.So that the payoff is
Wherein target critical value is still allowed, to obtain the quotation of worker's honesty.
The quotation of worker's honesty refers to giving the bid set of other winning bidders, and a certain winning bidder submits a tender as it very
When real cost, this winning bidder can obtain maximum utility value, that is, when submitting a tender greater than bona fide cost, this winning bidder can not win and be thrown
Task；When submit a tender be less than really be cost when, this winning bidder at least won in early several wheels are auctioned throwing task, value of utility or
For negative value, or it is no more than current value of utility.
(4) in entire task assignment procedure, the present invention provides encryption using half honest third party for space crowdsourcing system
Key generates service and the calculating of some simple auxiliary, protects the quotation information of worker, to prevent be leaked to other workers or
Person's platform.
The foregoing examples are merely illustrative of the technical concept and features of the invention, its object is to allow the person skilled in the art to be
It cans understand the content of the present invention and implement it accordingly, it is not intended to limit the scope of the present invention.It is all smart according to the present invention
The equivalent transformation or modification that refreshing essence is done, should be covered by the protection scope of the present invention.
Claims (10)
1. a kind of space crowdsourcing task auction bidding method for protecting privacy, which comprises the following steps:
S01: the mission bit stream submitted according to requestor and the status information of worker's submission are based on the execution of reverse auction process and appoint
Winning bidder's select permeability form in auction process is turned to the n:1 with the limitation of multiple 0-1 knapsacks and weights bigraph (bipartite graph) by business distribution
Matching problem, by the corresponding payoff of optimum auction theoretical calculation winning bidder, the payoff is wherein target critical value；
S02: when completing task assignment procedure, by introducing one and half honest third parties, using homomorphic cryptography technology to generation
The privacy information of worker encrypts.
2. the space crowdsourcing task auction bidding method of protection privacy according to claim 1, which is characterized in that crowdsourcing service is asked
The person of asking submits task sj=< lj,Tj,aj,ej>, wherein ljIt is the task s for needing to be completedjTwo-dimensional spatial location, TjIt indicates to appoint
Be engaged in sjEffective time range, ajIt is task sjType, ejIt is that requestor is supplied to completion task sjWorker remuneration.
3. the space crowdsourcing task auction bidding method of protection privacy according to claim 1, which is characterized in that the shape of worker
State information ui=< Li,Ai,ti,vi,δi>, LiIt is the worker u indicated by one group of orderly crossbar contactiTrip route, AiIt is
Worker uiThe task type set being capable of handling, tiIt is the initial time of trip, viIt is average travel speed, δiIt is work
Person uiThe maximum for the task of completing that can detour is around row distance.
4. the space crowdsourcing task auction bidding method of protection privacy according to claim 1, which is characterized in that the step
Task distribution is executed based on reverse auction process in S01, comprising the following steps:
Each worker uiExecuting task sjWhen can pay certain cost, each worker submits a quotation bijAs benefit
It repays, completes winning bidder's selection course and be equivalent to obtain system optimization target, system optimization target are as follows:
Wherein, dijExpression worker uiCompletion task sjNeed the additional distance to detour from original path, xij=1 indicates j-th
Task is assigned to i-th of worker, is otherwise not yet assigned to the worker, and requires each task complete by a worker
At distributing to the accumulative maximum around row distance no more than the worker for the task that each worker completes around row distance；Such as
Fruit worker uiQuotation b is used in auctionijWin task sj, i.e. xij=1, which is referred to as the winning bidder when front-wheel auction
One of；Finally, it is that each winning bidder calculates corresponding payment p that platform, which is based on Myerson optimum auction theory,ij。
5. the space crowdsourcing task auction bidding method of protection privacy according to claim 1, which is characterized in that the step
S02 includes:
Worker encrypts bid information using public key, and encrypted bid information is sent to platform；Platform architecture
Bigraph (bipartite graph) is weighted, weight is equal to task sjSupplier be ready that the reward of payment subtracts the bid b of workerij, then platform to
Third party sends encrypted side right；Half honest third party decrypts weight using private key and is ranked up, then will be after sequence
Weight again encrypting and transmitting to platform；Platform is based on encryption weight and executes task distribution and payment calculating process, is got the bid
Person's set and the encryption payoff to winning bidder, and third party is sent them to, it is got paid in by third party's decryption
The payoff of mark person.
6. a kind of space crowdsourcing task auction bidding system for protecting privacy, which is characterized in that platform, work including being set to cloud
Person end and half honest third square end；
The platform: the mission bit stream submitted according to requestor and the status information of worker's submission are based on reverse auction process and hold
Winning bidder's select permeability form in auction process is turned to the n:1 weighting two with the limitation of multiple 0-1 knapsacks by the distribution of row task
Portion's figure matching problem, by the corresponding payoff of optimum auction theoretical calculation winning bidder, the payoff is that wherein target is critical
Value；
The status information of itself is sent to platform, according to the mission bit stream issued on platform, in conjunction with itself by the worker end
Restrictive condition, submit a tender to task；
Half honest third square end when completing task assignment procedure, is believed using privacy of the homomorphic cryptography technology to the worker of generation
Breath is encrypted.
7. the space crowdsourcing task auction bidding method of protection privacy according to claim 6, which is characterized in that crowdsourcing service is asked
The person of asking submits task sj=< lj,Tj,aj,ej>, wherein ljIt is the task s for needing to be completedjTwo-dimensional spatial location, TjIt indicates to appoint
Be engaged in sjEffective time range, ajIt is task sjType, ejIt is that requestor is supplied to completion task sjWorker remuneration.
8. the space crowdsourcing task auction bidding method of protection privacy according to claim 6, which is characterized in that the shape of worker
State information ui=< Li,Ai,ti,vi,δi>, LiIt is the worker u indicated by one group of orderly crossbar contactiTrip route, AiIt is
Worker uiThe task type set being capable of handling, tiIt is the initial time of trip, viIt is average travel speed, δiIt is work
Person uiThe maximum for the task of completing that can detour is around row distance.
9. the space crowdsourcing task auction bidding method of protection privacy according to claim 6, which is characterized in that described based on anti-
Task distribution is executed to auction process, comprising the following steps:
Each worker uiExecuting task sjWhen can pay certain cost, each worker submits a quotation b to platformij
As compensation, platform completes winning bidder's selection course and is equivalent to obtain system optimization target, system optimization target are as follows:
Wherein, dijExpression worker uiCompletion task sjNeed the additional distance to detour from original path, xij=1 indicates j-th
Task is assigned to i-th of worker, is otherwise not yet assigned to the worker, and requires each task complete by a worker
At distributing to the accumulative maximum around row distance no more than the worker for the task that each worker completes around row distance；Such as
Fruit worker uiQuotation b is used in auctionijWin task sj, i.e. xij=1, which is referred to as the winning bidder when front-wheel auction
One of；Finally, it is that each winning bidder calculates corresponding payment p that platform, which is based on Myerson optimum auction theory,ij。
10. the space crowdsourcing task auction bidding method of protection privacy according to claim 6, which is characterized in that worker makes
Bid information is encrypted with public key, and encrypted bid information is sent to platform；Platform architecture weights bigraph (bipartite graph), power
Value is equal to task sjSupplier be ready that the reward of payment subtracts the bid b of workerij, then platform sends to third party and encrypts
Side right afterwards；Half honest third party decrypts weight using private key and is ranked up, and then encrypts the weight after sequence simultaneously again
It is sent to platform；Platform is based on encryption weight and executes task distribution and payment calculating process, obtains winning bidder's set and in
The encryption payoff of mark person, and third party is sent them to, it is got paid by third party's decryption to the payoff of winning bidder.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810742158.4A CN109003172A (en) | 2018-07-09 | 2018-07-09 | Protect the space crowdsourcing task auction bidding method of privacy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810742158.4A CN109003172A (en) | 2018-07-09 | 2018-07-09 | Protect the space crowdsourcing task auction bidding method of privacy |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109003172A true CN109003172A (en) | 2018-12-14 |
Family
ID=64599295
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810742158.4A Pending CN109003172A (en) | 2018-07-09 | 2018-07-09 | Protect the space crowdsourcing task auction bidding method of privacy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109003172A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119635A (en) * | 2019-04-25 | 2019-08-13 | 武汉大学 | A kind of secret protection incentive mechanism method towards insincere platform |
| CN110460440A (en) * | 2019-08-23 | 2019-11-15 | 安徽大学 | A kind of dynamic virtual machine distribution method based on combination cloud auction mechanism and secret protection |
| CN111105142A (en) * | 2019-11-25 | 2020-05-05 | 哈尔滨工程大学 | Crowdsourcing task allocation method facing user personalized privacy protection |
| CN111507757A (en) * | 2020-04-09 | 2020-08-07 | 中南大学 | Crowd sensing excitation method for improving task completion rate of remote area |
| CN113361775A (en) * | 2021-06-08 | 2021-09-07 | 南京大学 | Crowdsourcing auction method for time interval coverage task |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222302A (en) * | 2017-07-03 | 2017-09-29 | 深圳大学 | The space mass-rent task distribution system and method built with part homomorphic encryption scheme |
| CN107360146A (en) * | 2017-07-03 | 2017-11-17 | 深圳大学 | One kind connects guaranteed secret protection space mass-rent task distribution system and method |
| CN107590722A (en) * | 2017-09-15 | 2018-01-16 | 中国科学技术大学苏州研究院 | Movement based on reverse auction is called a taxi the order allocation method of service system |
-
2018
- 2018-07-09 CN CN201810742158.4A patent/CN109003172A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107222302A (en) * | 2017-07-03 | 2017-09-29 | 深圳大学 | The space mass-rent task distribution system and method built with part homomorphic encryption scheme |
| CN107360146A (en) * | 2017-07-03 | 2017-11-17 | 深圳大学 | One kind connects guaranteed secret protection space mass-rent task distribution system and method |
| CN107590722A (en) * | 2017-09-15 | 2018-01-16 | 中国科学技术大学苏州研究院 | Movement based on reverse auction is called a taxi the order allocation method of service system |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110119635A (en) * | 2019-04-25 | 2019-08-13 | 武汉大学 | A kind of secret protection incentive mechanism method towards insincere platform |
| CN110119635B (en) * | 2019-04-25 | 2022-12-16 | 武汉大学 | Privacy protection incentive mechanism method facing to untrusted platform |
| CN110460440A (en) * | 2019-08-23 | 2019-11-15 | 安徽大学 | A kind of dynamic virtual machine distribution method based on combination cloud auction mechanism and secret protection |
| CN110460440B (en) * | 2019-08-23 | 2021-12-07 | 安徽大学 | Dynamic virtual machine allocation method based on combined cloud auction mechanism and privacy protection |
| CN111105142A (en) * | 2019-11-25 | 2020-05-05 | 哈尔滨工程大学 | Crowdsourcing task allocation method facing user personalized privacy protection |
| CN111105142B (en) * | 2019-11-25 | 2023-06-30 | 哈尔滨工程大学 | Crowd-sourced task allocation method for user personalized privacy protection |
| CN111507757A (en) * | 2020-04-09 | 2020-08-07 | 中南大学 | Crowd sensing excitation method for improving task completion rate of remote area |
| CN111507757B (en) * | 2020-04-09 | 2024-03-15 | 中南大学 | Crowd sensing excitation method for improving task completion rate in remote areas |
| CN113361775A (en) * | 2021-06-08 | 2021-09-07 | 南京大学 | Crowdsourcing auction method for time interval coverage task |
| CN113361775B (en) * | 2021-06-08 | 2023-08-25 | 南京大学 | Crowd-sourced auction method for time interval coverage tasks |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109003172A (en) | Protect the space crowdsourcing task auction bidding method of privacy | |
| Li et al. | On location privacy-preserving online double auction for electric vehicles in microgrids | |
| Sun et al. | Blockchain-enhanced high-confidence energy sharing in internet of electric vehicles | |
| Li et al. | Credit-based payments for fast computing resource trading in edge-assisted Internet of Things | |
| Sun et al. | Contract-based resource sharing for time effective task scheduling in fog-cloud environment | |
| CN109033865A (en) | The method for allocating tasks of secret protection in a kind of space crowdsourcing | |
| Luo et al. | Blockchain-enabled two-way auction mechanism for electricity trading in internet of electric vehicles | |
| Li et al. | A strategy-proof privacy-preserving double auction mechanism for electrical vehicles demand response in microgrids | |
| Wang et al. | Towards privacy-driven truthful incentives for mobile crowdsensing under untrusted platform | |
| CN110493182B (en) | Crowd sensing worker selection mechanism and system based on block chain position privacy protection | |
| Sun et al. | Privacy-preserving verifiable incentive mechanism for online crowdsourcing markets | |
| CN106161415A (en) | A kind of information processing method and mobile gunz perception application platform | |
| CN106714183B (en) | Heterogeneous spectrum allocation method for protecting privacy | |
| Li et al. | Toward decentralized fair data trading based on blockchain | |
| An et al. | Where am I parking: Incentive online parking-space sharing mechanism with privacy protection | |
| CN109728904A (en) | A kind of spatial network querying method for protecting privacy | |
| Micali et al. | Cryptography miracles, secure auctions, matching problem verification | |
| Skowronski | On the applicability of the GRIDNET protocol to Smart Grid environments | |
| Thyagarajan et al. | Opensquare: Decentralized repeated modular squaring service | |
| CN113626876A (en) | Consensus method based on power grid block chain | |
| Cheng et al. | A secure and fair double auction framework for cloud virtual machines | |
| Chen et al. | Privacy-preserving spectrum auction design: challenges, solutions, and research directions | |
| Yuan et al. | LbSP: Load-balanced secure and private autonomous electric vehicle charging framework with online price optimization | |
| CN113657616B (en) | Updating method and device of federal learning model | |
| Jung et al. | Enabling privacy-preserving auctions in big data |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181214 |