Rational Delegation Computation Protocol Based on Fully Homomorphic Encryption
LI Qiu-xian1, TIAN You-liang1,2, WANG Zuan1
1. College of Computer Science and Technology, Guizhou University, Guiyang, Guizhou 550025, China;
2. National Key Laboratory of Public Big Data, Guiyang, Guizhou 550025, China
Abstract：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,and can achieve global Pareto optimality.
[1] Goldwasser S,Kalai Y T,Rothblum G N.Delegating computation:Interactive proofs for Muggles[A].ACM Symposium on Theory of Computing[C].Victoria,British Columbia,Canada,DBLP,2008.113-122.
[2] Goldwasser S,Micali S,Rackoff C.The knowledge complexity of interactive proof systems[J].SIAM Journal on Computing,1989,18(1):186-208.
[3] Kalai Y T,Raz R.Probabilistically Checkable Arguments[M].Advances in Cryptology-CRYPTO 2009.Berlin Heidelberg:Springer,2009.143-159.
[4] Gentry,Craig.Fully homomorphic encryption using ideal lattices[J].Stoc,2009,9(4):169-178.
[5] Gennaro R,Wichs D.Fully Homomorphic Message Authenticators[M].Advances in Cryptology-ASIACRYPT 2013.Berlin Heidelberg:Springer,2013.301-320.
[6] Gennaro R,Gentry C,Parno B.Non-interactive Verifiable Computing:Outsourcing Computation to Untrusted Workers[M].Advances in Cryptology-CRYPTO 2010.Berlin Heidelberg:Springer,2010.465-482.
[7] Chung K M,Kalai Y,Vadhan S.Improved Delegation of Computation Using Fully Homomorphic Encryption[M].Advances in Cryptology-CRYPTO 2010.Berlin Heidelberg:Springer,2010.483-501.
[8] 田有亮,马建峰,彭长根,等.秘密共享体制的博弈论分析[J].电子学报,2011,39(12):2790-2795. TIAN Y L,MA J F,PENG C G,et al.Game-theoretic analysis for the secret sharing scheme[J].Acta Electronica Sinica,2011,39(12):2790-2795.
[9] 田有亮,李秋贤.理性密码协议研究进展[J].贵州大学学报:自然科学版,2018,(3):14-23. TIAN Y L,LI Q X.Research progress on rational cryptography protocol[J].Journal of Guizhou University:Natural Science Edition,2018,(3):14-23.
[10] Xiao L,Chen Y,Lin W S,et al.Indirectreciprocity security game for large-scale wireless networks[J].IEEE Transactions on Information Forensics & Security,2012,7(4):1368-1380.
[11] Xiao L,Chen T,Liu J,et al.Anti-jamming transmission stackelberg game with observation errors[J].IEEE Communications Letters,2015,19(6):949-952.
[12] Wang Y,Wu Q,Wong D S,et al.Securely Outsourcing Exponentiations with Single Untrusted Program for Cloud Storage[M].Computer Security-ESORICS 2014.Springer International Publishing,2014.326-343.
[13] Chen X,Li J,Susilo W.Efficient fair conditional payments for outsourcing computations[J].IEEE Transactions on Information Forensics & Security,2012,7(6):1687-1694.
2019, Vol. 47 
