On the complexity of privacy-preserving complex event processing

  • Authors:
  • Yeye He;Siddharth Barman;Di Wang;Jeffrey F. Naughton

  • Affiliations:
  • University of Wisconsin-Madison, Madison, USA;University of Wisconsin-Madison, Madison, USA;Worcester Polytechnic Institute, Worcester, USA;University of Wisconsin-Madison, Madison, USA

  • Venue:
  • Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been adopted in a variety of applications, the privacy implications of event pattern reporting mechanisms have yet to be studied - a stark contrast to the significant amount of attention that has been devoted to privacy for relational systems. In this paper we present a privacy problem that arises when the system must support desired patterns (those that should be reported if detected) and private patterns (those that should not be revealed). We formalize this problem, which we term privacy-preserving, utility maximizing CEP (PP-CEP), and analyze its complexity under various assumptions. Our results show that this is a rich problem to study and shed some light on the difficulty of developing algorithms that preserve utility without compromising privacy.