.png){kind=icon}
.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Encryption
Protocols
Optimization
Cloud computing
Privacy
Sensors
Cryptography
data privacy
optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
Organization
View more organizations