Page 347 - 《软件学报》2021年第6期
P. 347

冯能先  等:基于理性信任模型的理性委托计算协议                                                         1921


          [4]    Gennaro R, Gentry C, Parno B. Non-Interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. Berlin:
             Springer-Verlag, 2010. 465−482.
          [5]    Yao AC. Protocols for secure computations. In: Proc. of the Annual Symp. on Foundations of Computer Science. IEEE Computer
             Society, 1982. 160−164.
          [6]    Chung KM, Yael TK, Salil P. Improved delegation of computation using fully homomorphic encryption. In: Proc. of the CRYPTO.
             2010. 483−501.
          [7]    Cantti R, Riva B, Rothblum GN. Practical delegation of computation using multiple servers. In: Proc. of the 18th ACM Conf. on
             Computer and Communications Security. ACM, 2011. 445−454.
          [8]    Xu G, Amariucai GT, Guan Y. Delegation of computation with verification outsourcing: curious verifiers. IEEE Trans. on Parallel
             Distributed Systems, 2017,28(3):717−730.
          [9]    Katz J. Bridging game theory and cryptography: Recent results and future directions. In: Proc. of the TCC. 2008. 251−272.
         [10]    Halpem J, Teague V. Rational secret sharing and multiparty computation: Extend abstract. In: Proc. of the STOC. 2004. 623−632.
         [11]    Tian YL, Ma JF, Peng CG, Ji WJ. Game-Theoretic analysis for the secret sharing scheme. Acta Electronica Sinica, 2011,39(12):
             2790−2795 (in Chinese with English abstract).
         [12]    Azar PD, Micali S. Rational proofs. In: Proc. of the Annual ACM Symp. on Theory of Computing. ACM, 2012. 1017−1028.
         [13]    Azar PD, Micali S. Super-Efficient rational proofs. In: Proc. of the 14th ACM Conf. on Electronic Commerce. ACM, 2013. 29−30.
         [14]    Inasawa K, Yasunaga K. Rational proofs against rational verifiers. IACR Cryptology ePrint Archive, 2017,2017:270.
         [15]    Guo S,  Hubácek P,  Rosen A, Vald  M.  Rational  arguments: Single round delegation with sublinear verification. In: Proc. of the
             ITCS. 2014. 523−540.
         [16]    Chen J, McCauley S, Singh S. Rational proofs with multiple provers. In: Proc. of the ITCS. 2016. 237−248.
         [17]    Tian YL, Peng CG, Lin DD. Bayesian mechanism for rational secret sharing scheme. Science China Information Sciences, 2015,
             58(5):1−13.
         [18]    Yin X, Tian YL, Wang HL. Fair and rational delegation computation protocol. Ruan Jian Xue Bao/Journal of Software, 2018,29(7):
             1953−1962 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/5362.htm [doi: 10.13328/j.cnki.jos.005362]
         [19]    Tian YL, Li QX, Zhang D, Wang LJ. Provably secure rational delegation computation protocol. Journal on Communications, 2019,
             40(7):35−143 (in Chinese with English abstract).
         [20]    Tian YL, Guo J, Wu YL, Lin H. Towards attack and defense views of rational delegation of computation. IEEE Access, 2019,7:
             44037−44049.
         [21]    Pham V, Khouzani MHR, Cid C. Optimal contracts for outsourced computation. In: Proc. of the Decision and Game Theory for
             Security (GameSec 2014). Cham: Springer-Verlag, 2014. 79−98.
         [22]    Khouzani MHR, Pham V, Cid C. Incentive engineering for outsourced computation in the face of collusion. In: Proc. of the 13th
             Annual Workshop on the Economics of Information Security (WEIS 2014). 2014.
         [23]    Li QX, Tian YL. Rational delegation computing using information theory and game theory approach. In: Proc. of the 26th Int’l
             Conf. of Multi Media Modeling. 2020. 669−680.
         [24]    Vaidya J, Yakut I, Basu A. Efficient integrity verification for outsourced collaborative filtering. In: Proc. of the 2014 IEEE Int’l
             Conf. on Data Mining (ICDM). IEEE, 2014. 560−569.
         [25]    Mehrdad N. Rational trust modeling. In: Proc. of the GameSec 2018. 2018. 418−431.
         [26]    Hoffstein J, Pipher J, Silver MJH. NTRU: A ring-based public key cryptosystem. In: Proc. of the 3rd Int’l Symp. on Algorithmic
             Number Theory. Berlin: Springer-Verlag, 1998. 267−288.
         [27]    Stehle D, Steinfeld R. Making NTRU as secure as worst-case problem over idea lattices. In: Proc. of the Eurocrypt 2011. LNCS
             6632. Springer-Verlag, 2011. 27−47.
         [28]    Pedersen  TP. Non-Interactive  and information-theoretic secure verifiable secret sharing.  In: Proc. of the  CRYPTO’91. 1992.
             129−140.
         [29]    Roger BM. An Introduction to Game Theory. Oxford: Oxford University Press, 1985.
         [30]    Wang  Q,  Zhou FC, Peng S,  Xu ZF.  Verifiable outsourced  computation with full delegation. In: Proc. of  the ICA3PP. 2018.
             270−287.
   342   343   344   345   346   347   348   349   350