A Confidentiality Preserving Publicly Verifiable Computation for Multivariate Polynomials

被引:0
|
作者
Sun Jiameng [1 ]
Zhu Binrui [1 ]
Jing, Qin [1 ,2 ]
Ma Jixin [3 ]
机构
[1] Shandong Univ, Sch Math, Jinan 250100, Shandong, Peoples R China
[2] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
[3] Univ Greenwich, Sch Comp & Math Sci, Ctr Comp & Computat Sci, London, England
关键词
cloud computing; Big Data; outsourcing computation; high degree polynomial; LARGE-SCALE SYSTEMS;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
With the development of cloud services, outsourcing computation tasks to a commercial cloud server has drawn attentions by various communities, especially in the Big Data age. Public verifiability offers a flexible functionality in real circumstance where the cloud service provider (CSP) may be untrusted or some malicious users may slander the CSP on purpose. However, sometimes the computational result is sensitive and is not willing to be exposed in the public verification phase. In this paper, we present a confidential-preserving public verifiable computation (CP-PVC) scheme for Evaluation of High Degree Polynomials. Compared with previous proposals, our scheme achieves confidentiality of computational result, while not sacrificing the property of public verifiability. We also provide the algorithm and experimental evaluation to show the efficiency of our scheme.
引用
收藏
页码:5 / 12
页数:8
相关论文
共 50 条
  • [31] Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation
    Schoenmakers, Berry
    Veeningen, Meilof
    de Vreede, Niels
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, ACNS 2016, 2016, 9696 : 346 - 366
  • [32] ON COMPUTATION COMPLEXITY OF SOME CLASSES OF MULTIVARIATE POLYNOMIALS
    GASHKOV, SB
    VESTNIK MOSKOVSKOGO UNIVERSITETA SERIYA 1 MATEMATIKA MEKHANIKA, 1988, (02): : 89 - 91
  • [33] Computation of simple and group factors of multivariate polynomials
    Pradeep Misra
    Guoxiang Gu
    Rajnikant V. Patel
    Circuits, Systems and Signal Processing, 1997, 16 : 455 - 473
  • [34] Computation of simple and group factors of multivariate polynomials
    Misra, P
    Gu, GX
    Patel, RV
    CIRCUITS SYSTEMS AND SIGNAL PROCESSING, 1997, 16 (04) : 455 - 473
  • [35] Multi-Server Verifiable Computation of Low-Degree Polynomials
    Zhang, Liang Feng
    Wang, Huaxiong
    43RD IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2022), 2022, : 596 - 613
  • [36] Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations
    Sun, Yujuan
    Yu, Yu
    Li, Xiangxue
    Zhang, Kai
    Qian, Haifeng
    Zhou, Yuan
    INFORMATION SECURITY AND PRIVACY, PT I, 2016, 9722 : 293 - 309
  • [37] Best-of-Both-Worlds Multiparty Quantum Computation with Publicly Verifiable Identifiable Abort
    Chung, Kai-Min
    Huang, Mi-Ying
    Tang, Er-Cheng
    Zhang, Jiapeng
    ADVANCES IN CRYPTOLOGY, PT VI, EUROCRYPT 2024, 2024, 14656 : 119 - 148
  • [38] Privacy-preserving and verifiable protocols for scientific computation outsourcing to the cloud
    Chen, Fei
    Xiang, Tao
    Yang, Yuanyuan
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (03) : 2141 - 2151
  • [39] Protecting Function Privacy and Input Privacy in the Publicly Verifiable Outsourcing Computation of Polynomial Functions
    Song, Beibei
    Zhou, Dehua
    Wu, Jiahe
    Yuan, Xiaowei
    Zhu, Yiming
    Wang, Chuansheng
    FUTURE INTERNET, 2023, 15 (04):
  • [40] Publicly Verifiable Secure Multi-Party Computation Framework Based on Bulletin Board
    Li, Xiaotong
    Wang, Hao
    Li, Zhi
    Wu, Lei
    Wei, Xiaochao
    Su, Ye
    Lu, Rongxing
    IEEE TRANSACTIONS ON SERVICES COMPUTING, 2024, 17 (04) : 1698 - 1711