Towards reducing delegation overhead in replication-based verification: An incentive-compatible rational delegation computing scheme

Chen, Zerui; Tian, Youliang; Xiong, Jinbo; Peng, Changgen; Ma, Jianfeng

doi:10.1016/j.ins.2021.03.047

Cited by 10 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One future direction would be to combine the time prediction [42] with the measurement of the participant's behavioral uncertainty [43], to verify the computing party with a high reputation with a low verification probability, and reduce the computation cost to a computing party. Another future direction would be to extend our scheme to the rational delegation of computation like [23]. Our work will focus on reducing the cost of the computing party.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

A rational delegating computation protocol based on reputation and smart contract

Chen

Wang

et al. 2021

J Cloud Comp

View full text Add to dashboard Cite

The delegating computation has become an irreversible trend, together comes the pressing need for fairness and efficiency issues. To solve this problem, we leverage game theory to propose a smart contract-based solution. First, according to the behavioral preferences of the participants, we design an incentive contract to describe the motivation of the participants. Next, to satisfy the fairness of the rational delegating computation, we propose a rational delegating computation protocol based on reputation and smart contract. More specifically, rational participants are to gain the maximum utility and reach the Nash equilibrium in the protocol. Besides, we design a reputation mechanism with a reputation certificate, which measures the reputation from multiple dimensions. The reputation is used to assure the client’s trust in the computing party to improve the efficiency of the protocol. Then, we conduct a comprehensive experiment to evaluate the proposed protocol. The simulation and analysis results show that the proposed protocol solves the complex traditional verification problem. We also conduct a feasibility study that involves implementing the contracts in Solidity and running them on the official Ethereum network. Meanwhile, we prove the fairness and correctness of the protocol.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Subsequently, to reduce the delegation computing overhead. Chen et al [23] proposed a novel incentive-compatible rational delegation computing scheme. The lowest delegation overhead achieved by this scheme is only n/(2n − 2) of that achieved by Dong's scheme [22], where n means the number of servers.…”

Section: Introductionmentioning

confidence: 99%

A rational delegating computation protocol based on reputation and smart contract

Chen

Wang

et al. 2021

J Cloud Comp

View full text Add to dashboard Cite

show abstract

“…Game theory is always used to predict the behavior of rational players, where the players are no longer viewed as being honest or corrupt and will not choose a strategy without motivation. 15 Specifically, players who follow the protocol are honest, and players who deviate from the protocol are corrupt. By contrast, all parties are simply rational motivated by some utility function.…”

Section: Related Workmentioning

confidence: 99%

DE‐RSTC: A rational secure two‐party computation protocol based on direction entropy

Chen

Wang

et al. 2022

Int J of Intelligent Sys

View full text Add to dashboard Cite

Rational secure multi-party computation means two or more rational parties complete a function on private inputs. Unfortunately, players sending false information can prevent the protocol from executing correctly, which will destroy the fairness of the protocol. To ensure the fairness of the protocol, the existing works on achieving fairness by specific utility functions. In this paper, we leverage game theory to propose the direction entropy-based solution. To this end, we utilize the direction entropy to examine the player's strategy uncertainty and quantify its strategy from different dimensions. Then, we provide mutual information to construct a new utility for the players.What's more, we measure the mutual information of players to appraise their strategies. By analyzing and proofing of protocol, we show that the protocol reaches a Nash equilibrium when players choose a cooperative strategy. Furthermore, we

show abstract

“…Data replication in the cloud environment is described as making multiple physical copies for each logical data object and locating replica copies in different locations or storage nodes [18][19][20]. Depending on the cloud replication goals, there are many ways to implement data replication in a cloud replication system environment.…”

Section: Introductionmentioning

confidence: 99%

Replication Strategy with Comprehensive Data Center Selection Method in燙loud Environments

Fazlina¹,

Latip²,

Ibrahim³

et al. 2023

Computers, Materials &Amp; Continua

View full text Add to dashboard Cite

As the amount of data continues to grow rapidly, the variety of data produced by applications is becoming more affluent than ever. Cloud computing is the best technology evolving today to provide multi-services for the mass and variety of data. The cloud computing features are capable of processing, managing, and storing all sorts of data. Although data is stored in many high-end nodes, either in the same data centers or across many data centers in cloud, performance issues are still inevitable. The cloud replication strategy is one of best solutions to address risk of performance degradation in the cloud environment. The real challenge here is developing the right data replication strategy with minimal data movement that guarantees efficient network usage, low fault tolerance, and minimal replication frequency. The key problem discussed in this research is inefficient network usage discovered during selecting a suitable data center to store replica copies induced by inadequate data center selection criteria. Hence, to mitigate the issue, we proposed Replication Strategy with a comprehensive Data Center Selection Method (RS-DCSM), which can determine the appropriate data center to place replicas by considering three key factors: Popularity, space availability, and centrality. The proposed RS-DCSM was simulated using CloudSim and the results proved that data movement between data centers is significantly reduced by 14% reduction in overall replication frequency and 20% decrement in network usage, which outperformed the current replication strategy, known as Dynamic Popularity aware Replication Strategy (DPRS) algorithm.

show abstract

Towards reducing delegation overhead in replication-based verification: An incentive-compatible rational delegation computing scheme

Cited by 10 publications

References 19 publications

A rational delegating computation protocol based on reputation and smart contract

A rational delegating computation protocol based on reputation and smart contract

DE‐RSTC: A rational secure two‐party computation protocol based on direction entropy

Replication Strategy with Comprehensive Data Center Selection Method in燙loud Environments

Contact Info

Product

Resources

About