1 / 6

Some open questions: aggregation and privacy protection Coding, information theory and signal processing Du, Kargupta, V

Some open questions: aggregation and privacy protection Coding, information theory and signal processing Du, Kargupta, Vora. Is this the question?. Allowed queries of form Closure h ({h i (x): minimum support of =  }) Require responses of the form that enable accurate determination of

yin
Download Presentation

Some open questions: aggregation and privacy protection Coding, information theory and signal processing Du, Kargupta, V

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Some open questions: aggregation and privacy protectionCoding, information theory and signal processingDu, Kargupta, Vora

  2. Is this the question? Allowed queries of form Closureh({hi(x): minimum support of = }) Require responses of the form that enable accurate determination of f(x): minimum support of = ’ typically >>  While preventing determination of g(x)  x or g(x) if g(x) an outlier, i.e. x an outlier Privacy should be representation-invariant What is minimal information required for the “legitimate” activity? Poorvi Vora/CS/GWU

  3. Privacy is related to data-representationData representation questions • Modelling of data relationships • Entropy/mutual information (often used for discrete-valued data) • Number of principal components (often used for continuous-valued data) • Clustering into separate regimes in appropriate representations/codes: Fourier, Walsh, etc. • Consequent question: optimal source code • What is a good source code? • For example, jpeg is a decent compression, though lossy, of images • Walsh transform: similar band-limitedness notion in terms of decision tree lengths, data points used in a single query Poorvi Vora/CS/GWU

  4. Adversary modelling What we know is if • the adversary is allowed any kind of adaptive query, and • the adversary wants error to go to zero the minimum cost per bit is bounded below, tightly, if • both adversary and database are willing to participate in an unbounded number of queries. So • make it expensive to ask a question, • stop questioning (bound number of queries) • make it such that the capacity for allowed patterns is high, and capacity for private information is low How? • Can one limit the adversary in any other ways to obtain anything more interesting? (polynomial time is not enough of a limitation) Poorvi Vora/CS/GWU

  5. Instead of uniform perturbation • Allow a total of np lies to n binary questions • What kinds of shapes can the ellipse be made to look like by computationally bounded Alice and Bob • What would be preserved? The “average” shape? Poorvi Vora/CS/GWU

  6. Lying in a multiparty function evaluation Poorvi Vora/CS/GWU

More Related