Protecting Function Privacy and Input Privacy in the Publicly Verifiable Outsourcing Computation of Polynomial Functions

Author:

Song Beibei1ORCID,Zhou Dehua2ORCID,Wu Jiahe1ORCID,Yuan Xiaowei1ORCID,Zhu Yiming1ORCID,Wang Chuansheng2

Affiliation:

1. College of Cyber Security, Jinan University, Guangzhou 511436, China

2. College of Information Science and Technology, Jinan University, Guangzhou 510632, China

Abstract

With the prevalence of cloud computing, the outsourcing of computation has gained significant attention. Clients with limited computing power often outsource complex computing tasks to the cloud to save on computing resources and costs. In outsourcing the computation of functions, a function owner delegates a cloud server to perform the function’s computation on the input received from the user. There are three primary security concerns associated with this process: protecting function privacy for the function owner, protecting input privacy for the user and guaranteeing that the cloud server performs the computation correctly. Existing works have only addressed privately verifiable outsourcing computation with privacy or publicly verifiable outsourcing computation without input privacy or function privacy. By using the technologies of homomorphic encryption, proxy re-encryption and verifiable computation, we propose the first publicly verifiable outsourcing computation scheme that achieves both input privacy and function privacy for matrix functions, which can be extended to arbitrary multivariate polynomial functions. We additionally provide a faster privately verifiable method. Moreover, the function owner retains control over the function.

Funder

National Natural Science Foundation of China

Guangdong Basic and Applied Basic Research Foundation

TESTBED2

Publisher

MDPI AG

Subject

Computer Networks and Communications

Reference33 articles.

1. On data banks and privacy homomorphisms;Rivest;Found. Secur. Comput.,1978

2. Mitzenmacher, M. (June, January 31). Fully homomorphic encryption using ideal lattices. Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA.

3. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages;Rogaway;Proceedings of the Advances in Cryptology—CRYPTO 2011—31st Annual Cryptology Conference,2011

4. Yao, C.C. (1986, January 27–29). How to generate and exchange secrets. Proceedings of the 27th Annual Symposium on Foundations of Computer Science, Toronto, ON, Canada.

5. Demmler, D., Schneider, T., and Zohner, M. (2015, January 8–11). ABY—A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. Proceedings of the 22nd Annual Network and Distributed System Security Symposium, NDSS 2015, San Diego, CA, USA.

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Security-Enhanced Function Privacy Attribute-Based Encryption;Communications in Computer and Information Science;2024

2. Privacy-Preserving Large Language Models (PPLLMs);SSRN Electronic Journal;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3