National Natural Science Foundation of China (No.61772008);Science and Technology Top-notch Talents Support Project of Education Department of Guizhou Province (黔教合KY字[2016]060);Science and Technology Major Project of Guizhou Province (No.20183001);Science and Technology Project of Guizhou Province (黔科合平台人才[2017]5788号);Ministry of Education - China Mobile Research Fund (No.MCM20170401);Training Project of Guizhou University (黔科合平台人才[2017]5788)
The traditional delegation computation require the verification party to verify the results
which leads to low efficiency of computation protocol.To solve this problem
this paper combines the game principal-agent theory and the fully homomorphic encryption technology to propose a rational delegation computation protocol.This protocol guarantees the correctness of the results through the utility function between the participants
without the validation of the prover.Firstly
we use the game principal-agent theory to construct a game model.Secondly
we combine the fully homomorphic encryption technology to construct the rational delegation computation protocol.Finally
we test and analyze the protocol
the results show that this protocol not only guarantees the safety and validity