DBScholar

Back to papers

On the Complexity of Privacy-Preserving Complex Event Processing

Summary: Formalizes privacy-preserving, utility-maximizing CEP (PP-CEP): report desired event patterns while concealing private patterns, introducing pattern-level privacy for CEP distinct from relational settings. Analyzes complexity under multiple models, proving hardness and barriers to utility-preserving algorithms. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1545
Venue
PODS
Year
2011
Pagerank
5.6643118e-05
Overall Rank
7,241 | 50.33%
DOI
10.1145/1989284.1989304

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{he_pods11,
        address = {New York, NY, USA},
        series = {{PODS} '11},
        title = {{On the Complexity of Privacy-Preserving Complex Event Processing}},
        url = {https://dl.acm.org/doi/10.1145/1989284.1989304},
        doi = {10.1145/1989284.1989304},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {He, Yeye and Barman, Siddharth and Wang, Di and Naughton, Jeffrey F.},
        year = {2011}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 7 of 7 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers