CTS Events
November 14, 2012

Dr. Nebiyou Tilahun, UPP, presents a seminar entitled "An agent based model of origin destination estimation (ADOBE)" Wednesday, November 14th at 4:00 pm in Rm 1127 SEO


November 7, 2012

Mr. Thomas Murtha, CMAP, will address the CTS-IGERT community at 4:00 p.m. in Room 1127 SEO.


October 24, 2012

Please join us in welcoming Dr. Bo Zou, CME, on Wednesday, October 24th, Room 1127 SEO, 4:00 p.m.


CTS Happenings
September 25, 2012

Award Received by Joshua Auld, CTS-IGERT alumnus.


April 20, 2012

Congratulations to James Biagioni, CTS Fellow and CS PhD candidate, winner of the Dean's Scholar award.


January 2, 2012

James Biagioni, CTS Fellow, receives "Best Presentation Award" at SenSys2011


July 30, 2010

Dr. Ouri Wolfson, Dr. Phillip Yu, and Leon Stenneth, CS student and CTS Associate, recently had a paper accepted to the 6th IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2010).


November 16, 2011

Dr. Bhaskar DasGupta, Associate Professor, Department of Computer Science and Engineering, UIC, presents a seminar entitled "On Communication Protocols that Compute Almost Privately" on Wednesday, November 16, 4:00 p.m. in Room 1000 SEO.

This presentation is based on a publication authored by: Marco Comi (UIC), Bhaskar DasGupta (UIC), Michael Schapira (Princeton) and Venkatakumar Srinivasan(UIC).

Privacy preserving computational models have become an important research area due to the increasingly widespread usage of sensitive data in networked environments, as evidenced by distributed computing applications, game-theoretic settings (e.g., auctions) and more. Over the years computer scientists have explored many quantifications of privacy in computation. Much of this research focused on designing perfectly privacy-preserving protocols, i. e., protocols whose execution reveals no information about the parties' private inputs beyond that implied by the outcome of the computation. Unfortunately, perfect privacy is often either impossible, or infeasibly costly to achieve (e.g., requiring impractically extensive communication steps). To overcome this, researchers have also investigated various notions of approximate privacy.

In this talk, we further investigate and generalize the approximate privacy model recently introduced by Feigenbaum et al. An original motivation of this line of research, as explained in details in Feifenbaum et al.'s paper, comes from privacy concerns in auction theory in Economics. We explore the privacy properties of a natural class of communication protocols that we refer to as "dissection protocols". Informally, in a dissection protocol the communicating parties are restricted to answering questions of the form "Is your input between the values a and b (under a pre-defined order over the possible inputs)?". We prove that for a large class of functions, called tiling functions, there always exists a dissection protocol that provides a constant average-case privacy approximation ratio for uniform or "almost uniform" probability distributions over inputs. To establish this result we present an interesting connection between the approximate privacy framework and basic concepts in computational geometry. We show that such a good privacy approximation ratio for tiling functions does not, in general, exist in the worst case. We also discuss extensions of the basic setup to more than two parties and to non-tiling functions, and provide calculations of privacy approximation ratios for two functions of interest.

Bhaskar DasGupta is currently an Associate Professor in the Computer Science department at University of Illinois at Chicago (UIC) and also affiliated with the Bioengineering department at UIC. He did his PhD from University of Minnesota in 1995, was a post-doctoral fellow at DIMACS and jointly at University of Waterloo and McMaster University in Canada before he joined the Computer Science department of Camden campus of Rutgers University; in 2001 he moved to UIC. His specific research interests include application of combinatorial techniques to design efficient algorithms for computational problems in bioinformatics, systems biology and hybrid systems; his broader research interests include designing efficient combinatorial algorithms for computationally hard problems in diverse areas in addition to bioinformatics such as computational geometry, optical networks, and combinatorial auctions. His research works have been supported by numerous NSF grants, including an NSF CAREER award.