* Faculty       * Staff       * Students & Alumni       * Committees       * Contact       * Institute Directory
* Undergraduate Program       * Graduate Program       * Courses       * Institute Catalog      
* Undergraduate       * Graduate       * Institute Admissions: Undergraduate | Graduate      
* Colloquia       * Seminars       * News       * Events       * Institute Events      
* Overview       * Lab Manual       * Institute Computing      
No Menu Selected

* News


Privacy-Preserving Data Aggregation over Participatory Networks

Wenbo He
Department of Computer Science University of Illinois at Urbana-Champaign

Wednesday, March 26, 2008
SAGE 4101 - 4:00 p.m. to 5:00 p.m.
Refreshments at 3:30 p.m.


The emerging participatory networked embedded systems, designed for aggregated information collection with fine-granularity, are viewed as new generation of pervasive computing systems. We expect both social and economic impact of participatory networks. Applications of participatory networks are likely to deal with highly sensitive or private information. Hence, one of the pressing concerns of users is the confidentiality of the data collected about them. Therefore, we need a way to collect aggregated information while at the same time preserve data privacy. In this talk, I will present two privacy-preserving data aggregation schemes for additive aggregation functions. The first scheme, Cluster-based Private Data Aggregation (CPDA), leverages clustering protocol and algebraic properties of polynomials. It has the advantage of incurring less communication overhead. The second scheme, Slice-Mix-AggRegaTe (SMART), builds on slicing techniques and the associative property of addition. It has the advantage of incurring less computation overhead. The goal of this work is to bridge the gap between collaborative data collection and privacy preservation of individual data. I assess the two schemes by privacy-preservation efficacy, communication overhead, and data aggregation accuracy. Since both schemes trade message overhead for privacy, I will propose efficiency enhancement method for privacy preserving data aggregation when message overhead is a big concern. Finally, I will conclude this talk by discussing my future plan.


Wenbo He is a Ph.D. candidate in Department of Computer Science, at the University of Illinois at Urbana-Champaign, where she is supervised by Professor Klara Nahrstedt. Wenbo's research focuses on pervasive computing, security and privacy issues in networked embedded systems. Wenbo received the Mavis Memorial Fund Scholarship Award from College of Engineering of UIUC in 2006, and the C. W. Gear Outstanding Graduate Award in 2007 from the Department of Computer Science at UIUC. She is also a recipient of the Vodafone Fellowship from 2005 to 2008, and the NSF TRUST Fellowship in 2007. Wenbo got her M.S. from the Department of Electrical and Computer Engineering at UIUC and M.Eng. from the Department of Automation at Tsinghua University, Beijing, China, in 2000 and 1998 respectively. She received her B.S. from the Department of Automation at the Harbin Engineering University, Harbin, China in 1995. During August 2000 to January 2005, Wenbo was a software engineer in Cisco Systems, Inc.

Hosted by: Boleslaw Szymanski (x2714)

Administrative support: Sharon Simmons (x8291)

For more information:

See the speaker's home page

Last updated: September 7, 2005