arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1809.02267math.OCcs.CRcs.SYeess.SY
收藏

基于部分同态加密的云优化

Cloud-based Quadratic Optimization with Partially Homomorphic Encryption

University of Pennsylvania(宾夕法尼亚大学);University of California, Irvine(加州大学尔湾分校);University of California, Berkeley(加州大学伯克利分校);University of California, Los Angeles(加州大学洛杉矶分校)

Andreea B. Alexandru, Konstantinos Gatsis, Yasser Shoukry, Sanjit A. Seshia, Paulo Tabuada, George J. Pappas

AI总结:

本文提出了一种基于云的协议,用于解决涉及多方的二次优化问题,其中各方希望保持其信息隐私。该协议基于拉格朗日对偶问题的投影梯度上升,并利用部分同态加密和安全多方计算技术。通过形式化的密码学定义,证明该协议实现了计算隐私,即没有计算上高效的算法可以获取超出输入输出可推断信息的隐私信息。为了减少协议的通信复杂度,引入了一种变体,以牺牲较弱的隐私保证为代价实现该目标。本文详细讨论了两种算法的计算和通信复杂度特性,并通过实现进行了分析。最后讨论了计算隐私和其他隐私概念,如从协议输出中非唯一检索隐私信息。

摘要:

大规模分布式控制系统的发展导致了将昂贵的计算任务外包到云计算平台的需求,同时也引发了对收集敏感数据隐私的担忧。本文开发了一种用于涉及多方的二次优化问题的云协议,各方希望保持其信息隐私。该协议基于拉格朗日对偶问题的投影梯度上升,并利用部分同态加密和安全多方计算技术。通过形式化的密码学定义,证明该协议实现了计算隐私,即不存在任何参与方可以使用的计算上有效的算法,以获取超出其输入和输出可推断信息的隐私信息。为了减少所提出协议的通信复杂度,我们引入了一种变体,以牺牲较弱的隐私保证为代价实现该目标。我们详细讨论了两种算法的计算和通信复杂度特性,理论上和通过实现。最后,本文以计算隐私和其他隐私概念如从协议输出中非唯一检索隐私信息进行了讨论。

英文摘要:

The development of large-scale distributed control systems has led to the outsourcing of costly computations to cloud-computing platforms, as well as to concerns about privacy of the collected sensitive data. This paper develops a cloud-based protocol for a quadratic optimization problem involving multiple parties, each holding information it seeks to maintain private. The protocol is based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure multi-party computation techniques. Using formal cryptographic definitions of indistinguishability, the protocol is shown to achieve computational privacy, i.e., there is no computationally efficient algorithm that any involved party can employ to obtain private information beyond what can be inferred from the party's inputs and outputs only. In order to reduce the communication complexity of the proposed protocol, we introduced a variant that achieves this objective at the expense of weaker privacy guarantees. We discuss in detail the computational and communication complexity properties of both algorithms theoretically and also through implementations. We conclude the paper with a discussion on computational privacy and other notions of privacy such as the non-unique retrieval of the private information from the protocol outputs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑