On the complexity of privacy-preserving complex event processing

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.

[1]  Deeparnab Chakrabarty,et al.  Approximability of Sparse Integer Programs , 2009, Algorithmica.

[2]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[3]  Ying Li,et al.  Microsoft CEP Server and Online Behavioral Targeting , 2009, Proc. VLDB Endow..

[4]  Luca Trevisan,et al.  Inapproximability of Combinatorial Optimization Problems , 2004, Electron. Colloquium Comput. Complex..

[5]  Johannes Gehrke,et al.  What is "next" in event processing? , 2007, PODS.

[6]  Elke A. Rundensteiner,et al.  Sequence Pattern Query Processing over Out-of-Order Event Streams , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[7]  Edward D. Lazowska,et al.  Quantitative System Performance , 1985, Int. CMG Conference.

[8]  Christos Koufogiannakis,et al.  Greedy D{\ensuremath{\Delta}}-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost , 2009, ICALP.

[9]  Peter Kall,et al.  Stochastic Programming , 1995 .

[10]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

[11]  Elke A. Rundensteiner,et al.  Active complex event processing , 2010, Proc. VLDB Endow..

[12]  Yanlei Diao,et al.  High-performance complex event processing over streams , 2006, SIGMOD Conference.

[13]  Neil Immerman,et al.  Efficient pattern matching over event streams , 2008, SIGMOD Conference.

[14]  藤重 悟.  Submodular functions and optimization , 1991 .

[15]  Samuel Madden,et al.  ZStream: a cost-based query processor for adaptively detecting composite events , 2009, SIGMOD Conference.

[16]  Yanlei Diao,et al.  SASE: Complex Event Processing over Streams , 2006, ArXiv.

[17]  Satoru Iwata,et al.  Submodular Function Minimization under Covering Constraints , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[18]  Aravind Srinivasan,et al.  On k-Column Sparse Packing Programs , 2009, IPCO.

[19]  Jonathan Goldstein,et al.  Consistent Streaming Through Time: A Vision for Event Stream Processing , 2006, CIDR.

[20]  Christos Koufogiannakis,et al.  Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost , 2013, Algorithmica.