[Home]   [  News]   [  Events]   [  People]   [  Research]   [  Education]   [Visitor Info]   [UCSD Only]   [Admin]
Home > Events > CCoM > Abstract
Search this site:


Directors:
Randolph E. Bank
Philip E. Gill
Michael Holst

Administrative Contact:
Terry Le

Office: AP&M 7431
Phone: (858)534-9813
Fax: (858)534-5273
E-mail: tele@ucsd.edu
Privacy-Preserving Linear Programming

Prof Olvi Mangasarian
UCSD and University of Wisconsin, Madison

Abstract:

By utilizing machine learning techniques for privacy-preserving classification, we consider linear programs with partitioned constraint matrices with each partition belonging to an entity that is unwilling to share its partition or make it public. For vertically partitioned matrices we employ a random matrix transformation that generates a linear program based on all the privately held data but without revealing the data or making it public. The component groups of the solution of the transformed problem can be decoded and made public only by the original group that owns the corresponding constraint matrix columns. For a horizontally partitioned constraint matrix, we multiply each partition by an appropriately generated and privately held constraint matrix. This results in an equivalent linear program that does not reveal any of the original data or make it public. The solution vector of the transformed linear program is publicly generated and is available to all entities.

Tuesday, January 11, 2011
11:00AM AP&M 2402