.png){kind=icon}
返回
Cloud-Based Quadratic Optimization With Partially Homomorphic Encryption
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2020.3005920.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This article develops a cloud-based protocol for a constrained quadratic optimization problem involving multiple parties, each holding private data. The protocol is based on the projected gradient ascent on the Lagrange dual problem and exploits partially homomorphic encryption and secure communication techniques. Using formal cryptographic definitions of indistinguishability, the protocol is shown to achieve computational privacy. We show the implementation results of the protocol and discuss its computational and communication complexity. We conclude this article with a discussion on privacy notions.
Keyword:
Encryption
Protocols
Optimization
Cloud computing
Privacy
Sensors
Cryptography
data privacy
optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
Effects of crystal structure of poly(β-propiolactone) blocks on the cooperative crystallization of a polyethylene-block-poly(β-propiolactone) diblock copolymer.png)
Polymer
PolymerIF0
PREAI
分享收藏ChemInform Abstract: Functionalized Molecules Studied by STM: Motion, Switching and ReactivityChemInform
ChemInformIF0
PREAI
分享收藏
查看更多内容