隐私保护的可验证多元多项式外包计算方案

任艳丽; 谷大武; 蔡建兴; 黄春水

doi:10.11959/j.issn.1000-436x.2015172

您当前的位置：

首页 >

文章列表页 >

隐私保护的可验证多元多项式外包计算方案

学术论文 | 更新时间：2024-06-05

- 隐私保护的可验证多元多项式外包计算方案
- Verifiably private outsourcing scheme for multivariate polynomial evaluation
- 通信学报 2015年36卷第8期页码：23-30
- 作者机构：
  
  1. 上海大学通信与信息工程学院,上海 200444
  2. 上海交通大学电子信息与电气工程学院,上海 200240
- 作者简介：
  
  [ "任艳丽（1982-），女，山西运城人，博士，上海大学副研究员、硕士生导师，主要研究方向为公钥密码学、可验证外包计算、网络安全协议等。" ]
  [ "谷大武（1970-），男，河南漯河人，博士，上海交通大学教授、博士生导师，主要研究方向为密码分析与设计、信息分析与密码工程、计算机安全体系结构等。" ]
  [ "蔡建兴（1991-），男，浙江温州人，上海大学硕士生，主要研究方向为公钥密码学、可验证外包计算等。" ]
  [ "黄春水（1991-），男，湖北黄冈人，上海大学硕士生，主要研究方向为公钥密码学、可验证外包计算等。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61202367);教育部高校博士点基金资助项目(20120073110094);上海市自然科学基金资助项目(12ZR1443700);上海市教委创新基金资助项目(14YZ020)
- DOI：10.11959/j.issn.1000-436x.2015172
  中图分类号： TP309
- 网络出版日期：2015-08，
  
  纸质出版日期：2015-08-25
- 稿件说明：
移动端阅览
任艳丽, 谷大武, 蔡建兴, 等. 隐私保护的可验证多元多项式外包计算方案[J]. 通信学报, 2015,36(8):23-30.

Yan-li REN, Da-wu GU, Jian-xing CAI, et al. Verifiably private outsourcing scheme for multivariate polynomial evaluation[J]. Journal on communications, 2015, 36(8): 23-30.
任艳丽, 谷大武, 蔡建兴, 等. 隐私保护的可验证多元多项式外包计算方案[J]. 通信学报, 2015,36(8):23-30. DOI： 10.11959/j.issn.1000-436x.2015172.

Yan-li REN, Da-wu GU, Jian-xing CAI, et al. Verifiably private outsourcing scheme for multivariate polynomial evaluation[J]. Journal on communications, 2015, 36(8): 23-30. DOI： 10.11959/j.issn.1000-436x.2015172.

摘要

随着云计算的发展和大数据时代的到来，如何对隐私数据进行外包计算且有效验证计算结果具有重要的现实意义。基于多线性映射和同态加密方案，提出了可验证的多元多项式外包计算方案，用户可准确验证外包计算结果的正确性。方案在标准模型中可证安全，且多项式函数和用户输入对于服务器都是保密的。分析表明，用户计算量远小于服务器的计算代价以及直接计算多项式函数。

Abstract

With the development of cloud computing and big data

it had important practical significance for how to outsource private data and verify the computing result efficiently.A verifiably outsourcing scheme for multivariate polynomial evaluation based on multilinear maps and homomorphic encryption was proposed where the user could verify the computing result exactly.The proposed scheme is provably secure without random oracles and the multivariate polynomial itself and the input of the function are private for the server.Moreover

the cost of the user is much smaller than that of the server

and it is much smaller than that of computing the multivariate polynomial directly.

关键词

Keywords

references

GENNARO R , GENTRY C , PARNO B . Non-interactive verifiable computing:outsourcing computation to untrusted workers [A ] . CRYPTO 2010 [C ] . 2010 . 465 - 482 .

CHUNG K M , KALAI Y , VADHAN S P . Improved delegation of computation using fully homomorphic encryption [A ] . CRYPTO 2010 [C ] . 2010 . 483 - 501 .

APPLEBAUM B , ISHAI Y , KUSHILEVITZ E . From secrecy to soundness:efficient verification via secure computation [A ] . ICALP 2010 [C ] . 2010 . 152 - 163 .

PARNO B , RAYKOVA M , VAIKUNTANATHAN V . How to delegate and verify in public:verifiable computation from attribute-based encryption [A ] . TCC 2012,LNCS 7194 [C ] . 2012 . 422 - 439 .

CHOI S,KATZ J , KUMARESAN R , CID C . Multi-client non-interactive verifiable computation [A ] . TCC 2013,LNCS 7785 [C ] . 2013 . 499 - 518 .

CHEN X,LI J,MA J , TANG Q , LOU W . New algorithms for secure outsourcing of modular exponentiations [A ] . ESORICS 2012,LNCS 7459 [C ] . 2012 . 541 - 556 .

HOHENBERGER S , LYSYANSKAYA A . How to securely outsource cryptographic computations [A ] . TCC 2005.LNCS 3378 [C ] . 2005 . 264 - 282 .

ZHANG L , NAINI R S . Private outsourcing of polynomial evaluation and matrix multiplication using multilinear maps [A ] . CANS 2013,LNCS 8257 [C ] . 2013 . 329 - 348 .

GREEN M , HOHENBERGER S , WATERS B . Outsourcing the decryption of ABE ciphertexts [EB/OL ] . http://static.usenix.org/events/sec11/tech/ full-papers/Green.pdf http://static.usenix.org/events/sec11/tech/ full-papers/Green.pdf .

LAI J,DENG R H , GUAN C , WENG J . Attribute-based encryption with verifiable outsourced decryption [J ] . IEEE Transactions on Information Forensics and Security , 2013 , 8 ( 8 ): 1343 - 1354 .

BENABBAS S , GENNARO R , VAHLIS Y . Verifiable delegation of computation over large datasets [A ] . CRYPTO 2011,LNCS 6841 [C ] . 2011 . 111 - 131 .

FIORE D , GENNARO R . Publicly verifiable delegation of large polynomials and matrix computations with applications [A ] . ACM CCS 2012 [C ] . 2012 . 501 - 512 .

MA X. , ZHANG F , LI J . Verifiable evaluation of private polynomials [A ] . The Fourth International Conference on Emerging Intelligent Data and Web Technologies [C ] .IEEE CPS, 2013 . 451 - 458 .

GARG S , GENTRY C , HALEVI S . Candidate multilinear maps from ideal lattices [A ] . EUROCRYPT 2013,LNCS 7881 [C ] . 2013 . 1 - 17 .

GARG S,GENTRY C,HALEVI S , SAHAI A , WATERS B . Attribute-based encryption for circuits from multilinear maps [A ] . CRYPTO 2013,LNCS 8043 [C ] . 2013 . 479 - 499 .

浏览量

1332

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

大数据环境下差分隐私保护技术及应用

大数据典型相关分析的云模型方法

云环境下协同作业的密码服务优化调度算法

M-RSF：面向Unikernel的一种多级反馈队列任务调度机制

基于强化学习的在线离线混部云环境下的调度框架