| 半诚实模型下的隐私保护集合交集计算协议 |
| |
| 引用本文： | 吴春英.半诚实模型下的隐私保护集合交集计算协议[J].青海师范大学学报(自然科学版),2014(3):9-13. |
| |
| 作者姓名： | 吴春英 |
| |
| 作者单位： | 青海师范大学 计算机学院,青海 西宁,810008 |
| |
| 基金项目： | 春教育部春晖计划(Z2014021)． |
| |
| 摘 要： | 鉴于给定的安全级别,椭圆曲线(ECC)比RSA和一般域上的离散对数计算速度快、密钥更短等优点.本文提出将集合的元素编码到椭圆曲线上,基于椭圆曲线上的三个困难问题(DL问题、CDH问题、DDH问题)假设,提出半诚实模型下的隐私保护集合交集汁算协议.整个方案构造新颖、简单,计算量小.与已有方案比较,计算复杂性和通信复杂性都达到了最低.
|
| 关 键 词： | 集合交集 隐私保护 椭圆曲线 |
Privacy-Preserving Set Intersection Computation Protocol in the Semi-honest Model |
| |
| WU Chun-ying.Privacy-Preserving Set Intersection Computation Protocol in the Semi-honest Model[J].Journal of Qinghai Normal University(Natural Science Edition),2014(3):9-13. |
| |
| Authors: | WU Chun-ying |
| |
| Institution: | WU Chun-ying;College of Computer Science,Qinghai Normal University; |
| |
| Abstract: | Because the ECC is faster than RSA and discrete logarithm in computation and other proper -ties for the same security grade. The novel solution to set intersection protocol is presented in semi-honest model which is based on three difficult problems （DL ;CDH ;DDH）. The new scheme has the advantages of simple structure ,novelty ,small computational cost ,but computation complexity and communication complexity has reached the optimum. |
| |
| Keywords: | set intersection privacy preservation elliptic curve |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
