Privacy preserving monitoring and surveillance in sensor networks

Authors:
Vladimir A. Oleshchuk
Affiliations:
Department of Information and Communication Technology, Agder University, Grimstad, Norway
Venue:
ISPA'07 Proceedings of the 2007 international conference on Frontiers of High Performance Computing and Networking
Year:
2007

Citing 9
Cited 0

Text algorithms

Text algorithms
Distributed recognition of patterns in time series data

Communications of the ACM
A new public key cryptosystem based on higher residues

CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
Secure multi-party computation problems and their applications: a review and open problems

Proceedings of the 2001 workshop on New security paradigms
A practical approach to solve Secure Multi-party Computation problems

Proceedings of the 2002 workshop on New security paradigms
Reliable Detection of Episodes in Event Sequences

ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Resilient aggregation in sensor networks

Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a problem of privacy preserving surveillance and monitoring in sensor networks. We propose a framework and a solution of the problem based on multi-party computations. Our approach use pattern matching on data streams from sensors in order to monitor and detect events of interest. We study a privacy preserving pattern matching problem where patterns are defined as sequences of constraints on input data items. We describe a new privacy preserving pattern matching algorithm over an infinite alphabet A where a pattern P is given as a sequence {pi1, pi2, ..., pin} of predicates pij defined on A. The algorithm addresses the following problem: given a pattern P and an input sequence t, find privately all positions in t where P matches t. The privacy preserving in the context of this paper means that sensor measurements will be evaluated as predicates pi(ej) privately, that is, sensors will not need to disclose the measurement values to the monitor.