作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (23): 150-153. doi: 10.3969/j.issn.1000-3428.2012.23.037

• 安全技术 • 上一篇    下一篇

基于可验全同态加密的委托计算方案

靳方元a,b,朱艳琴a,b,罗喜召a,b   

  1. (苏州大学 a. 计算机科学与技术学院;b. 江苏省计算机信息处理技术重点实验室,江苏 苏州 215006)
  • 收稿日期:2012-02-06 出版日期:2012-12-05 发布日期:2012-12-03
  • 作者简介:靳方元(1986-),男,硕士研究生,主研方向:网络与信息安全;朱艳琴,教授;罗喜召,博士
  • 基金资助:
    国家自然科学基金资助项目(61070170);苏州市应用基础研究计划基金资助项目(SYJG09024);苏州市融合通信重点实验室基金资助项目(SZS0805)

Delegation of Computation Scheme Based on Verifiable Fully Homomorphic Encryption

JIN Fang-yuan a,b, ZHU Yan-qin a,b, LUO Xi-zhao a,b   

  1. (a. School of Computer Science and Technology; b. Jiangsu Provincial Key Laboratory of Computer Information Processing Technology, Soochow University, Suzhou 215006, China)
  • Received:2012-02-06 Online:2012-12-05 Published:2012-12-03

摘要: 为降低委托计算方案中委托方与计算方的计算量和通信量,提高有效计算率 ,利用可验的全同态加密方案构造非交互的委托计算方案。分析结果表明,该方案满足委托计算方案的健壮性、完整性要求,委托方的复杂度为 ,计算方的复杂度为 ,通信量为 。与同类方案相比,验证过程更简单,有效计算率 ≥1/2。

关键词: 同态加密, 可验全同态加密, 委托计算, 可验证计算, 外包计算, 云计算

Abstract: In order to decrease the computation complexity and the transmission quantity between delegator and worker, meanwhile increasing the rate , this paper constructs a more efficient non-interactive delegation of computation by using verifiable fully homomorphic encryption scheme. Analysis result shows that the scheme satisfies the soundness and completeness of delegation of computation scheme. In the scheme, the delegator’s complexity is , worker’s complexity is , and transmission complexity is . Compared with other delegation of computation schemes, its verification process is more simple, and the rate ≥1/2.

Key words: homomorphic encryption, verifiable fully homomorphic encryption, delegation of computation, verifiable computation, outsourcing computation, cloud computation

中图分类号: