Verifiably private outsourcing scheme for multivariate polynomial evaluation
Academic paper|更新时间:2024-06-05
|
Verifiably private outsourcing scheme for multivariate polynomial evaluation
Journal on CommunicationsVol. 36, Issue 8, Pages: 23-30(2015)
作者机构:
1. 上海大学 通信与信息工程学院,上海 200444
2. 上海交通大学 电子信息与电气工程学院,上海 200240
作者简介:
基金信息:
The National Natural Science Foundation of China(61202367);The Doctoral Fund of Ministry of Education of China(20120073110094);The Natural Science Foundation of Shanghai(12ZR1443700);The Innovation Program of Shanghai Municipal Education Commission(14YZ020)
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 .
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 .