Affordable Access

Cloud-Based Quadratic Optimization with Partially Homomorphic Encryption

Authors
  • Alexandru, AB
  • Gatsis, K
  • Shoukry, Y
  • Seshia, SA
  • Tabuada, P
  • Pappas, GJ
Publication Date
May 01, 2021
Source
eScholarship - University of California
Keywords
License
Unknown
External links

Abstract

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.

Report this publication

Statistics

Seen <100 times