CN112232959A - Rational cloud computing excitation method based on credit mechanism - Google Patents
Rational cloud computing excitation method based on credit mechanism Download PDFInfo
- Publication number
- CN112232959A CN112232959A CN202011123636.7A CN202011123636A CN112232959A CN 112232959 A CN112232959 A CN 112232959A CN 202011123636 A CN202011123636 A CN 202011123636A CN 112232959 A CN112232959 A CN 112232959A
- Authority
- CN
- China
- Prior art keywords
- cloud
- reputation
- value
- computing
- task
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 230000007246 mechanism Effects 0.000 title claims abstract description 23
- 230000005284 excitation Effects 0.000 title claims abstract description 7
- 238000004364 calculation method Methods 0.000 claims abstract description 50
- 230000008901 benefit Effects 0.000 claims abstract description 14
- 238000012546 transfer Methods 0.000 claims description 16
- 230000008569 process Effects 0.000 claims description 11
- 238000011156 evaluation Methods 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 2
- 238000000151 deposition Methods 0.000 abstract description 3
- 230000006870 function Effects 0.000 description 6
- 230000006399 behavior Effects 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 238000002474 experimental method Methods 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004590 computer program Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 230000008450 motivation Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- 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/64—Protecting data integrity, e.g. using checksums, certificates or signatures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
-
- 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/0639—Performance analysis of employees; Performance analysis of enterprise or organisation operations
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/02—Payment architectures, schemes or protocols involving a neutral party, e.g. certification authority, notary or trusted third party [TTP]
-
- 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
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/38—Payment protocols; Details thereof
- G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
- G06Q20/3829—Payment protocols; Details thereof insuring higher security of transaction involving key management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Accounting & Taxation (AREA)
- Strategic Management (AREA)
- Computer Security & Cryptography (AREA)
- Human Resources & Organizations (AREA)
- General Business, Economics & Management (AREA)
- Software Systems (AREA)
- Finance (AREA)
- Development Economics (AREA)
- Economics (AREA)
- General Engineering & Computer Science (AREA)
- Marketing (AREA)
- Educational Administration (AREA)
- Entrepreneurship & Innovation (AREA)
- Technology Law (AREA)
- Quality & Reliability (AREA)
- Game Theory and Decision Science (AREA)
- Operations Research (AREA)
- Tourism & Hospitality (AREA)
- Health & Medical Sciences (AREA)
- Bioethics (AREA)
- General Health & Medical Sciences (AREA)
- Computer Hardware Design (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
- Computer And Data Communications (AREA)
Abstract
The invention discloses a rational cloud computing excitation method based on a credit mechanism, which introduces a rational concept to enable two self-benefited participants to make honest strategies, selects the cloud with the highest credit value of the two participants to participate in computing tasks through the credit mechanism, and mainly comprises six steps: issuing agreements, signing agreements, depositing deposits, returning calculation results, evaluating reputation values and uploading reputation values. Compared with the prior art, the scheme has the advantages that participants can select honest strategies and an intelligent contract is applied to solve the fairness problem of payment.
Description
Technical Field
The invention belongs to the field of game theory, and particularly relates to a rational cloud computing excitation method based on a reputation mechanism.
Background
With the rapid development of big data, the processing capability of the data is more and more emphasized. Some customers with limited capacity often need to delegate complex computing tasks to a cloud with strong computing power. Cloud computing is a novel computing mode and a brand-new infrastructure management method, can provide information resources, enterprise applications and business data as services to end users through the internet, can dynamically manage a large number of highly virtualized hardware server resources, and constructs a huge hardware resource pool so as to uniformly provide a service platform.
In the traditional cloud computing process, the result returned by the cloud needs to be verified so as to ensure the accuracy of the result. In a practical environment, due to the self-profit of the participants, both the trusting party and the calculating party hope that the interest of the participants is maximized. Based on the method, a plurality of students utilize the game theory to research the relationship among participants in the entrusted calculation, so that the calculation cloud is guaranteed to be honest to calculate, and the third-party verification process is banned.
In recent years, there are two schemes of encryption and backup for existing authentication of outsourced cloud computing. In the cryptography-based method, a client outsources tasks to a single cloud server. And the cloud returns the calculation result and proves that the calculation result is correct to the client. If the result is incorrect, encryption will ensure that the client is rejected with a high probability, but requires a purchase for the overhead of the encryption algorithm. In the backup-based method, a client provides the same task to a plurality of clouds, and the clouds independently calculate the task. And after the calculation is finished, the client collects and cross-checks the results. The consistency protocol can be used to verify the correctness of the results as long as the number of errors is below a threshold, but this scheme requires at least three backups increasing the overall cost.
In the traditional cloud computing process, a client and a cloud need to find a trusted third party in the fund transaction process to ensure the fairness of the transaction. A trusted third party in the real world is not easily found, and even finding it is expensive.
Disclosure of Invention
The invention aims to provide a rational cloud computing incentive method based on a reputation mechanism aiming at the problems of correctness and payment fairness of the existing cloud computing result.
The technical scheme of the invention is as follows:
a rational cloud computing incentive method based on a reputation mechanism relates to participants which mainly comprise a client, a computing cloud and a doubtful cloud.
1) Customer: a computing task needs to be delegated to participants of the computing cloud computing.
2) Cloud computing: the cloud selected by the customer to participate in the computing.
3 suspicious clouds: creating a cloud of suspicions on the reputation values uploaded by the customer.
Further, a two-way rational cloud computing excitation method based on a reputation mechanism, the proposed scheme mainly comprises six steps: issuing agreements, signing agreements, depositing deposits, returning calculation results, evaluating reputation values and uploading reputation values. The method comprises the following specific steps:
(1) and (3) issuing a protocol: this step is performed for the release of the protocol.
(2) Signing an agreement: both participants need to sign separately.
(3) Deposit of deposit: the cloud clouds of two parties participating in the calculation need to store the deposit stipulated by the protocol into the intelligent contract respectively.
(4) And returning a calculation result: and the cloud participating in the calculation returns a calculation result, and the client determines whether to call a trusted third party or not according to the returned result and the intelligent contract pays or loses money according to the result.
(5) Evaluating the reputation value: and after the round of computing task is finished, the client evaluates the credit value of the cloud according to the honesty degree of the cloud and calculates the global credit value of the cloud.
(6) Uploading reputation value: after the client calculates the reputation value, the client uploads the reputation value to the cloud participating in the calculation, and the cloud executes the update reputation value.
The invention provides a rational cloud computing incentive method based on a credit mechanism aiming at the problems of correctness of a computing result and fairness of payment amount. The scheme introduces a rational concept to enable participants of both self-benefitting parties to make honest strategies, and selects the cloud with the highest reputation value of the two parties to participate in the computing task through a reputation mechanism. The scheme can enable participants to select honest strategies and solve the fairness problem of payment by applying intelligent contracts. Moreover, the intelligent contract technology is used in the invention, so that the payment fairness is ensured and the cost is reduced.
Compared with the prior art, the invention has the beneficial effects that:
1) and calculating the correctness of the result: according to the rational cloud computing incentive method based on the reputation mechanism, rational participants select honest behavior strategies to maximize benefits of the rational participants.
2) And (3) payment fairness: and the intelligent contract technology is adopted in the payment stage to ensure the payment fairness.
Drawings
FIG. 1 is a diagram of a gaming process between two rational clouds of the present invention;
FIG. 2 is a diagram of a process of the invention for gaming between a customer and a suspect cloud;
FIG. 3 is a graph of reputation value changes of the present invention.
Detailed Description
The technical solutions of the present invention will be described clearly and completely with reference to the accompanying drawings, and it is to be understood that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
The invention provides a rational cloud computing excitation method based on a reputation mechanism, which mainly comprises six steps: issuing an agreement, signing the agreement, depositing a deposit, returning a calculation result, evaluating a credit value and uploading the credit value, and the method comprises the following specific steps of:
definition of C, C1、C2CT is the set of all clouds, chosen as the cloud, the client, participating in the computation.
Definition (PK)1CT,SK1CT) Is a key pair of the client CT.
1) Publishing protocol
Step 1: key distribution center KDC distributes public and private key Pair (PK) for client CT1CT,SK1CT)，SK1CTHeld by the client, PK1CTAnd sending the data to all clouds C.
Step 2: SK for CT1CTAnd after the computing task X is encrypted, the computing task X is issued to the blockchain, wherein the encrypted content comprises the computing task X, payment amount and result submitting time, and the purpose of the encrypted content is to facilitate the cloud to view.
And step 3: PK used for cloud and wanting to obtain task1CTAfter decryption, it is decided whether to accept task X or not according to its content.
And 4, step 4: the cloud that decides to accept task X will issue a corresponding request P in the blockchain.
And 5: the CT selects a two-party cloud C with the highest historical credit value in the credit certificate from the cloud sending the request P1、C2This calculation task is performed.
2) Signing agreements
Step 1: the Contract Contract of the CT construction protocol is sent to the C1、C2And (6) signing.
Step 2: c1、C2And returning the contract to the CT signature after signature.
And step 3: CT and C1、C2After all the signatures are signed, the protocol is uploaded to a block chain and broadcast to the whole network.
Defining 2g + r +2d as deposit for the customer into the smart contract.
And c + r is defined as a deposit for the computing cloud to deposit into the intelligent contract.
3) Deposit
Step 1: CT and C1、C2And respectively storing deposit into the intelligent contracts: (2 × g + r +2d, c + r).
Step 2: otherwise, the contract terminates.
Definition v is the cost that needs to be spent to compute a cloud computing task.
Definition d is the cost a customer needs to spend to calculate a reputation value maliciously.
Define r as the cost of invoking the TTP.
The foregoing gaming process between the two clouds is illustrated in fig. 1 and explained in detail as follows:
4) computing result return
Step 1: when C is present1、C2If the return results f (X) are equal in the submission time, the calculation result is considered to be correct, and at the moment, the intelligent contracts are respectively sent to the client terminal C1、C2Transfer to payment amount g and return to C1、C2The deposit c.
Step 2: when C is present1、C2And when the return results are not equal in the submission time, calling the TTP.
And step 3: when C is present1、C2Computing cloud honesty for one party (called honest cloud C)T) A party cloud malice (called malicious cloud C)F) At the moment, the intelligent contract is towards CTThe sum of money g transferred without receiving CFThe deposit C is awarded to CTAnd transfers the amount r to TTP.
And 4, step 4: when C is present1、C2If the results are all wrong, the intelligent contract returns deposit 2 x g to the CT and does not receive C1、C2The deposit c is awarded to the CT and the TTP is transferred to the amount r.
And 5: when C is present1、C2If the result f (X) is not returned in the submission time, the intelligent contract returns the deposit 2 x g to the CT and does not receive C1、C2The deposit c is awarded to the CT.
5) Evaluating reputation values
Step 1: after one round of task is finished, the CT is used for C according to the transaction condition of the round1、C2Making reputation values
And (4) evaluating.
Step 2: CT reputation value according to the current round
Global reputation value to previous round
And performing operation to form the latest global reputation value.
Definition (PK)2CT,SK2CT) Is a key pair of the client CT.
The foregoing process of gaming between two clouds is illustrated in fig. 2, and is explained in detail as follows:
6) uploading reputation values
Step 1: the KDC in turn distributes the Key Pair (PK) for the CT2CT,SK2CT)，SK2CTOwn, public key PK2CTIs sent to C1、C2。
Step 2: CT uses SK2CTFor reputation value
The encrypted ciphertext is used as a pair
And uploaded onto the blockchain. And step 3: c1、C2Using the public key PK2CTThe reputation value is decrypted and checked for correctness.
Definition CdA cloud that holds a suspect attitude for the reputation value.
And 4, step 4: and if the credit value uploaded by the CT holds the suspicion attitude, calling the TTP.
And 5: if CT does cheat, the intelligent contract transfers deposit d to CdAnd transfers the amount r to the account of the TTP.
Step 6: if CT does not cheat, the intelligent contract transfers the amount r to the account of TTP.
And 7: if CT does not upload credit value, the intelligent contract transfers deposit 2d to C1、C2The account of (1) transfers an amount d.
And 8: otherwise, the protocol terminates.
The foregoing reputation mechanism process is explained in detail as follows:
the computing cloud has a higher reputation value meaning that there is a greater chance of being selected by a customer. Therefore, the cloud which wants to obtain the computing task has motivation to execute the task honestly to improve the reputation value, which not only helps the client to know the computing cloud, but also enables the computing cloud to obey the protocol regulations and make honest behaviors. After each round of calculation is finished, the client evaluates the credit values of the cloud participating in the calculation, calculates the latest global credit value and uploads the global credit value to the block chain in a digital signature mode. The reputation value is the basis that the cloud can obtain a computing task, a client selects a corresponding cloud for computing according to different task requirements, and the probability of selection is higher when the reputation value of the client is higher. In a typical scenario, the customer will select the two-party cloud with the highest reputation value for computing.
In our reputation mechanism, we assume that all the computing clouds have an initial reputation value, and the reputation value of each transaction ending customer will be evaluated according to the honesty degree of the computing clouds, so as to update the reputation value. In the present reputation mechanism, reputation values are stored in blockchains in the form of reputation certificates, maintained and updated by the cloud itself. In each round of transaction, the cloud generates a reputation certificate, and the cloud reputation certificate format is shown in table 1:
table 1: reproduction Certificate (RC) format
The credit mechanism of the method mainly comprises four stages: querying a historical reputation value, evaluating a current reputation value, calculating a global reputation value, and updating a reputation value. The detailed explanation is as follows:
1) querying the historical reputation value: and the client performs a computing task according to the query historical reputation value in the reputation certificate held by the cloud sending the response message and selects two clouds with the highest reputation values from the query historical reputation value.
After a client sends a task, the cloud which wants to obtain the task sends a response message and generates a new reputation certificate for the upcoming task, and the client selects two clouds with the highest historical reputation value according to the reputation certificates of the clouds. Where new certificates are generated for the upcoming task as follows.
Definition of
The reputation value of the current wheel, the honest reputation value of the current wheel and the malicious reputation value of the current wheel.
Definitions H, S, D: (R) The method comprises the steps of representing the times of honest calculation in the calculation cloud, the total calculation times of the calculation cloud and the complexity coefficient of a task in one transaction.
2) Evaluating the current reputation value: after the cloud computing task is finished, the client can evaluate the credit value of the current round according to the honesty degree of the cloud.
The computing cloud has two credit states, namely honest computing and malicious computing after one task computing is finished. And after each calculation, the client evaluates the reputation value of the current round of the calculation cloud. Different tasks correspond to different reputation values due to different customer tasks. The evaluation of the current reputation value is shown by equation (1):
when α is 1, it means a cloud honest computing task. The reputation value evaluation formula of the computing cloud honest computing task is shown as formula (2):
when α is-1, it means a cloud honest computing task. The reputation value evaluation formula of the computing cloud honest computing task is shown as formula (3):
wherein LrepSatisfies the following conditions: -1. ltoreq.Lrep≤1
When L isrepWhen-1 is completely malicious to compute the cloud in one round of transaction;
when L isrepWhen 1, the cloud is fully honest for computing in one round of transaction.
3) Calculating a global reputation value: and the client calculates a global reputation value according to the historical reputation value in the reputation certificate held by the cloud and the estimated current round reputation value.
Definition of
The global reputation value of the cloud, the previous global reputation value and the current reputation value.
After one round of calculation tasks is finished, the client calculation calculates a global reputation value according to a historical reputation value and a previous current reputation value in a reputation certificate held by the cloud. The calculation of the global reputation value is shown by equation (4):
4) updating the reputation value: and the client signs and uploads the global reputation value of the cloud to the block chain, and the computing cloud updates the reputation certificate of the client after decryption.
After one-time calculation is finished, the customer signs the global reputation value of the cloud and uploads the global reputation value to the block chain, and the calculation cloud decrypts and updates the reputation certificate of the customer. This provides the next round with the latest global reputation value that the customer can view all the computing clouds from the blockchain. The latest reputation certificate of the cloud is in the format:
analysis of experiments
For the reputation value change experiment, the initial reputation value of the cloud is set to be equal to 60 and the number of calculation rounds is set to be 10. Set up C1、C2For clouds selected by customers to participate in computing, C' is a computing cloud that has not signed an agreement with the customer. FIG. 3 is a customer's cloud based computing after each round of computingThe honesty degree is subjected to the experiment of credit value evaluation.
1. Protocol analysis
1) Signing agreements
CT and C1、C2And after agreement, signing an agreement and broadcasting the agreement to the whole network.
Otherwise the protocol is terminated, C1、2＝(0,0)。
2) Deposit
And C1、C2And respectively storing deposit into the intelligent contracts: (2 × g + r +2d, c + h).
Otherwise the protocol is terminated, C1、2＝(0,0)。
2) Result CT return
When C is present1、C2The obtained benefits are as follows:
when C is present1、C2When one party is honest and the other party is malicious, the obtained benefits are as follows:
when C is present1、C2When one party is honest and the other party is honest, the obtained benefits are as follows:
when C is present1、C2When the results are all wrong results or the results are not submitted within the specified time, the obtained benefits are as follows:
otherwise, the benefits obtained by the two parties computing the cloud are:
3) reputation value transfer
If CdAnd calling the TTP if the credit value uploaded by the CT holds the doubtful attitude.
If CT does cheat, the benefits obtained are:
if CT is not cheated, the obtained benefits are as follows:
otherwise, if CdWithout doubt, the benefits obtained are:
otherwise, the resulting benefit is:
2. and (3) analyzing the correctness of the calculation result:
the only Nash equilibrium solution of the two cloud parties in the computing process is that the two cloud parties both make honest behaviors, the benefits of the two cloud parties cannot be lost only, and the benefits of the cloud parties are lost when the cloud parties make malicious behaviors.
For the cloud, when one cloud selects an honest strategy, the utility function obtained by the honest computing task of the other cloud is larger than that of the non-computing task, namely u (g-v) > u (-c-v); when one cloud selects a malicious strategy, the utility function obtained by the honest computing task of the other cloud is larger than the utility function of the non-computing task, namely u (g + c-v) > u (-c-v); when one cloud selects other strategies, the utility function obtained by the honest computing task of the other cloud is larger than the utility function of the non-computing task and is larger than the utility function of the malicious computing, namely: u (g + c-v) > u (-c-v). Since both clouds are rational, both clouds will select honest policy computation tasks.
3. Payment fairness analysis
Traditional transaction payment is to find a trusted intermediary, however, in realizing life, it is very difficult, and even expensive, to find a trusted intermediary. In our scheme, we use intelligent contract functionality. An intelligent contract is a computer program stored and capable of running on a blockchain, which program is stored in the blockchain in the form of code by an agreement previously signed by a participant. When the event is satisfied, the intelligent contract transfers or deducts the corresponding amount to the participant according to the protocol rule, thereby avoiding the condition that the middleman is bought or dishonest, and in the scheme, the intelligent contract is used for realizing the fairness of payment.
Although the present invention has been described in detail with reference to the foregoing embodiments, it will be apparent to those skilled in the art that various changes in the embodiments and/or modifications of the invention can be made, and equivalents and modifications of some features of the invention can be made without departing from the spirit and scope of the invention.
Claims (5)
1. A rational cloud computing excitation method based on a reputation mechanism is characterized by comprising the following steps: comprises six steps: issuing an agreement, signing the agreement, storing the deposit, returning a calculation result, evaluating a credit value and uploading the credit value; wherein the issuing protocol performs issuing of a protocol; the signing agreement means that two participants need to sign respectively; the deposit fund is a deposit fund required by two parties participating in calculation and respectively deposited into the intelligent contract according to the protocol; the calculation result return is a cloud return calculation result participating in calculation, and the client determines whether to call a trusted third party or not according to the returned result and whether to pay or not according to the result by the intelligent contract; after one round of calculation tasks are finished, the client evaluates the credit value of the cloud according to the honesty degree of the cloud and calculates the global credit value of the cloud; and the uploading reputation value is obtained by uploading the reputation value to a cloud participating in computing after the client computes the reputation value, and updating the reputation value by the cloud.
2. A reputation mechanism-based rational cloud computing incentive method according to claim 1, wherein: the reputation mechanism of the method comprises inquiring a historical reputation value, evaluating a current reputation value, calculating a global reputation value and updating the reputation value; the more lake query historical reputation values are calculated by selecting two clouds with the highest reputation values from reputation certificates held by clouds sending response messages by clients; the evaluation of the current credit value is that after the cloud computing task is finished, a client evaluates the credit value of the current round according to the honesty degree of the cloud; the global reputation value is calculated by a customer according to the historical reputation value and the current round reputation value in the reputation certificate held by the cloud; and the updating credit value is that the client signs the global credit value of the cloud and uploads the global credit value to the block chain, and the computing cloud updates the credit certificate of the computing cloud after decryption.
3. A reputation mechanism-based rational cloud computing incentive method according to claim 1, wherein: the method comprises the following specific steps:
1) publishing protocol
Step 1: key distribution center KDC distributes public and private key Pair (PK) for client CT1CT,SK1CT)，SK1CTHeld by the client, PK1CTSending the data to all clouds C;
step 2: SK for CT1CTThe method comprises the steps that a calculation task X is encrypted and then is issued to a block chain, wherein the encrypted content comprises the calculation task X, payment amount and submission result time;
and step 3: PK used for cloud and wanting to obtain task1CTDetermining whether to accept the task X or not according to the content after decryption;
and 4, step 4: deciding that the cloud that accepts task X will issue a corresponding request P in the blockchain;
and 5: the CT selects a two-party cloud C with the highest historical credit value in the credit certificate from the cloud sending the request P1、C2Performing a calculation task;
2) signing agreements
Step 1: sending the Contract Contract of the CT construction protocol to the clientC1、C2Signing;
step 2: c1、C2Returning the contract to the CT signature after signature;
and step 3: CT and C1、C2After all signatures are signed, the protocol is uploaded to a block chain to be broadcast to the whole network;
3) deposit
Step 1: CT and C1、C2And respectively storing deposit into the intelligent contracts: (2 × g + r +2d, c + h);
step 2: otherwise, the contract is terminated;
4) computing result return
Step 1: when C is present1、C2If the return results f (X) are equal in the submission time, the calculation result is considered to be correct, and at the moment, the intelligent contracts are respectively sent to the client terminal C1、C2Transfer to payment amount g and return to C1、C2The deposit c of (a);
step 2: when C is present1、C2Calling the TTP when the return results in the submission time are not equal;
and step 3: when C is present1、C2Computing the honesty of the cloud for one party, and when the cloud of one party is malicious, the intelligent contract is towards CTThe sum of money g transferred without receiving CFThe deposit C is awarded to CTAnd transfers the sum r to the TTP;
and 4, step 4: when C is present1、C2If the results are all wrong, the intelligent contract returns deposit 2 x g to the CT and does not receive C1、C2The deposit c is awarded to the CT and the amount r is transferred to the TTP;
and 5: when C is present1、C2If the result f (X) is not returned in the submission time, the intelligent contract returns the deposit 2 x g to the CT and does not receive C1、C2Award the CT with the deposit c;
5) evaluating reputation values
Step 1: after one round of task is finished, the CT is used for C according to the transaction condition of the round1、C2Make a reputation value Lrepn+1(ii) evaluation of (d);
step 2: CT reputation value L according to the current roundrepn+1Global reputation value G with previous roundrepnForm a calculationUpdating the global reputation value;
6) uploading reputation values
Step 1: the KDC in turn distributes the Key Pair (PK) for the CT2CT,SK2CT)，SK2CTOwn, public key PK2CTIs sent to C1、C2；
Step 2: CT uses SK2CTFor reputation value Grepn+1The encrypted ciphertext is used as the pair Grepn+1And uploading the digital signature to the blockchain;
and step 3: c1、C2Using the public key PK2CTDecrypting the reputation value and checking whether the reputation value is correct;
and 4, step 4: if suspicious cloud CdIf the credit value uploaded by the CT holds the doubtful attitude, calling the TTP;
and 5: if CT does cheat, the intelligent contract transfers deposit d to CdAnd transfers the sum r to the account of the TTP;
step 6: if the CT does not cheat, the intelligent contract transfers the amount r to the TTP account;
and 7: if CT does not upload credit value, the intelligent contract transfers deposit 2d to C1、C2Each transfer amount d of the account;
and 8: otherwise, the protocol terminates.
4. A reputation mechanism-based rational cloud computing incentive method according to claim 3, wherein: including the following relevant definitions: definition of C, C1、C2CT is the set of all clouds and is selected as the cloud and the client participating in the computation; definition CdA cloud which holds a suspect attitude for the reputation value uploaded by the customer; defining 2g + r +2d as deposit of the client into the intelligent contract; defining c + r as a deposit for storing the computing cloud into the intelligent contract; defining v as the cost required for computing the cloud computing task; defining d as the cost needed by the client to calculate the credit value maliciously; defining r as the cost of calling TTP; definition (PK)1CT,SK1CT) A key pair is used for uploading a task for a client; definition (PK)2CT,SK2CT) A key pair when uploading a reputation value for a customer; statorYi Lrepn+1，LHrepn+1，LDHrepn+1The credit value of the current wheel, the honest credit value of the current wheel and the malicious credit value of the current wheel; definition Grepn+1，Grepn，Lrepn+1The global reputation value of the cloud, the previous global reputation value and the current global reputation value are obtained; h and S are defined as the times of honest calculation in the calculation cloud and the total calculation times of the calculation cloud; definition D (R), A (R), T (R) are complexity coefficient of task in one round of transaction, benefit coefficient of one round of transaction and time coefficient of one round of transaction.
5. A reputation mechanism-based rational cloud computing incentive method according to claim 2, wherein: the specific implementation process of the reputation mechanism is as follows: after a client sends a task, the cloud which wants to obtain the task sends a response message and generates a new reputation certificate for the upcoming task, and the client selects two clouds with the highest historical reputation value according to the reputation certificates of the clouds; where the new credentials generated for the upcoming task are as follows:
the computing cloud has two credit states, namely honest computing and malicious computing after one task computing is finished; after each calculation, the client evaluates the credit value of the current round of the calculation cloud; different tasks correspond to different reputation values due to different client tasks; the evaluation of the current reputation value is shown by equation (1):
when α is 1, it means a cloud honest computing task; the reputation value evaluation formula of the computing cloud honest computing task is shown by the formula (2):
when α is-1, it means a cloud honest computing task; the reputation value evaluation formula of the computing cloud honest computing task is shown by the formula (3):
wherein D (R) satisfies 0 < D (R) ≦ 1; a (R) satisfies 0 < A (R) less than or equal to 1;
after one round of calculation tasks is finished, the client calculates a global credit value according to a historical credit value and a previous current credit value in a credit certificate held by the cloud; the calculation of the global reputation value is shown by equation (4):
Grepn+1＝Grepn+Lrepn+1
(4)
wherein ,Grepn+1Representing a global reputation value, G, of a computing cloudrepnRepresenting the global reputation value, L, of the previous roundrepn+1Representing a current round reputation value;
after one-time calculation is finished, a customer signs and uploads the global credit value of the cloud to a block chain, and the calculation cloud decrypts and updates the credit certificate of the customer; this provides the next round with the latest global reputation value that the customer can view from the blockchain for all computing clouds; the latest reputation certificate of the cloud is in the format:
CRCC,n+1＝CRCC-CT,n+1Sign(CRCC-CT,n+1)。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011123636.7A CN112232959B (en) | 2020-10-20 | 2020-10-20 | Rational cloud computing excitation method based on reputation mechanism |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011123636.7A CN112232959B (en) | 2020-10-20 | 2020-10-20 | Rational cloud computing excitation method based on reputation mechanism |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112232959A true CN112232959A (en) | 2021-01-15 |
| CN112232959B CN112232959B (en) | 2023-09-15 |
Family
ID=74118118
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011123636.7A Active CN112232959B (en) | 2020-10-20 | 2020-10-20 | Rational cloud computing excitation method based on reputation mechanism |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112232959B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187405A (en) * | 2015-08-14 | 2015-12-23 | 中国人民解放军理工大学 | Reputation-based cloud computing identity management method |
| CN107508792A (en) * | 2017-07-13 | 2017-12-22 | 福建师范大学 | A kind of data credible cognitive method in mobile cloud computing |
| US20180189100A1 (en) * | 2017-01-05 | 2018-07-05 | Hitachi, Ltd. | Distributed computing system |
| US20190081789A1 (en) * | 2017-09-13 | 2019-03-14 | Vijay K. Madisetti | Tokens or crypto currency using smart contracts and blockchains |
| WO2019155377A1 (en) * | 2018-02-12 | 2019-08-15 | Fazal Raheman | Decentralized algo-sharing infrastructure for zero-loss algorithmic trading |
| CN110473058A (en) * | 2019-07-25 | 2019-11-19 | 广东工业大学 | A kind of shared platform method of commerce based on block chain credit value |
| CN111371905A (en) * | 2020-03-27 | 2020-07-03 | 中国人民解放军国防科技大学 | Block chain layered consensus proving system structure and method based on cloud computing |
-
2020
- 2020-10-20 CN CN202011123636.7A patent/CN112232959B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105187405A (en) * | 2015-08-14 | 2015-12-23 | 中国人民解放军理工大学 | Reputation-based cloud computing identity management method |
| US20180189100A1 (en) * | 2017-01-05 | 2018-07-05 | Hitachi, Ltd. | Distributed computing system |
| CN107508792A (en) * | 2017-07-13 | 2017-12-22 | 福建师范大学 | A kind of data credible cognitive method in mobile cloud computing |
| US20190081789A1 (en) * | 2017-09-13 | 2019-03-14 | Vijay K. Madisetti | Tokens or crypto currency using smart contracts and blockchains |
| WO2019155377A1 (en) * | 2018-02-12 | 2019-08-15 | Fazal Raheman | Decentralized algo-sharing infrastructure for zero-loss algorithmic trading |
| CN110473058A (en) * | 2019-07-25 | 2019-11-19 | 广东工业大学 | A kind of shared platform method of commerce based on block chain credit value |
| CN111371905A (en) * | 2020-03-27 | 2020-07-03 | 中国人民解放军国防科技大学 | Block chain layered consensus proving system structure and method based on cloud computing |
Non-Patent Citations (3)
| Title |
|---|
| CHANGYU DONG 等: "Betrayal, Distrust, and Rationality: Smart Counter-Collusion Contracts for Verifiable Cloud Computing", ARXIV * |
| SHANGPING WANG 等: "Auditable Protocols for Fair Payment and Physical Asset Delivery Based on Smart Contracts", DIGITAL OBJECT IDENTIFIER 10.1109/ACCESS * |
| 李梦茹: "群智感知中基于区块链的安全激励机制研究", 中国优秀硕士论文全文数据库信息科技辑 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112232959B (en) | 2023-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Baza et al. | Privacy-preserving blockchain-based energy trading schemes for electric vehicles | |
| US20200273028A1 (en) | System and method for information protection | |
| US20220318907A1 (en) | Systems and methods for generating secure, encrypted communications across distributed computer networks for authorizing use of cryptography-based digital repositories in order to perform blockchain operations in decentralized applications | |
| JP7395701B2 (en) | Computer-implemented systems and methods for transaction mixing on a blockchain | |
| Kaur et al. | Scalability in blockchain: Challenges and solutions | |
| CN115801260B (en) | Block chain-assisted collaborative attack and defense game method in untrusted network environment | |
| Sun et al. | Privacy-preserving verifiable incentive mechanism for online crowdsourcing markets | |
| US20200082405A1 (en) | Method and system for client support in a blockchain network | |
| CN114565386A (en) | Block chain escrow transaction method and system with multi-party cooperative privacy protection | |
| Li et al. | Toward decentralized fair data trading based on blockchain | |
| Hong et al. | A secure peer to peer multiparty transaction scheme based on blockchain | |
| Sonnino et al. | Asterisk: Auction-based shared economy resolution system for blockchain | |
| Constantinides et al. | Block auction: A general blockchain protocol for privacy-preserving and verifiable periodic double auctions | |
| Xiong et al. | Anonymous auction protocol based on time-released encryption atop consortium blockchain | |
| Wang et al. | A privacy protection scheme for electricity transactions in the microgrid day-ahead market based on consortium blockchain | |
| Ye et al. | An anonymous and fair auction system based on blockchain | |
| CN109272318B (en) | Resource flow transaction method, device, equipment and medium applied to requester client | |
| CN116821952A (en) | Privacy data calculation traceability system and method based on block chain consensus mechanism | |
| US20230246822A1 (en) | Systems and methods for providing secure, encrypted communications across distributed computer networks by coordinating cryptography-based digital repositories in order to perform blockchain operations in decentralized applications | |
| US20230245111A1 (en) | Systems and methods for requesting secure, encrypted communications across distributed computer networks for authorizing use of cryptography-based digital repositories in order to perform blockchain operations in decentralized applications | |
| US20230246817A1 (en) | Systems and methods for generating secure, encrypted communications across distributed computer networks for authorizing use of cryptography-based digital repositories in order to perform blockchain operations in decentralized applications | |
| CN112232959A (en) | Rational cloud computing excitation method based on credit mechanism | |
| CN112995356B (en) | Domain name resolution service system and method based on block chain | |
| CN114760067A (en) | Block chain group intelligent perception system privacy security protection method using zero knowledge certification | |
| CN114547695A (en) | Block chain transaction privacy protection method based on homomorphic encryption in Internet of things |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |