| 注册
首页|期刊导航|计算机工程与应用|一个较快速的整数上的全同态加密方案

一个较快速的整数上的全同态加密方案

汤殿华 祝世雄 曹云飞

计算机工程与应用2012,Vol.48Issue(28):117-122,6.
计算机工程与应用2012,Vol.48Issue(28):117-122,6.DOI:10.3778/j.issn.1002-8331.2012.28.023

一个较快速的整数上的全同态加密方案

Faster fully homomorphic encryption scheme over integer

汤殿华 1祝世雄 1曹云飞1

作者信息

  • 1. 保密通信重点实验室,成都610041
  • 折叠

摘要

Abstract

In order to improve the efficiency of the fully homomorphic encryption scheme, based on partially approximate common divisor problem, a fully homomorphic encryption scheme over the integer is presented. Compared with the Dijk et al' s scheme, this scheme has these advantages of a smaller public key size and faster computation. Under this condition of allowing for a negligible probability of decryption error, this paper further reduces the complexity of the decryption algorithm, thus the given scheme is more efficient. Finally, it is proved that the scheme is semantically secure.

关键词

全同态加密/公钥尺寸/效率/安全性

Key words

fully homomorphic encryption/ public key size/ efficiency/ security

分类

信息技术与安全科学

引用本文复制引用

汤殿华,祝世雄,曹云飞..一个较快速的整数上的全同态加密方案[J].计算机工程与应用,2012,48(28):117-122,6.

基金项目

保密通信重点实验室基金项目(No.9140C1103031002). (No.9140C1103031002)

计算机工程与应用

OACSCDCSTPCD

1002-8331

访问量0
|
下载量0
段落导航相关论文