Sean Peisert

Home Page


Research Projects


Talks and Tutorials

Professional Service


Students & Postdocs




Photograph of me lecturing at the blackboard (credit: R. Benjamin Shapiro, 2002).

Upcoming events that I'm involved with:

NSPW 2017 (Oct. 2–4, 2017)

S&P 2018 (May 20–24, 2018)

CSET 2018 (Aug. 2018)

S&P 2019 (May 19–23, 2019)



I3P Data Sanitization

This seed project looked at defining means for understanding what data can be sanitized, and how. Traditionally, techniques for sanitizing or anonymizing data have included masking, adding noise, or enforcing regularity. They typically also assume a "closed world." However, these techniques often either make data unusable for research or operational purposes or fail to completely sanitize the data. Thus, our data sanitization work builds on past techniques by also using an "open world" assumption. We also ask, what are the relationships between data fields that would need to be made (e.g., by making associations from external datasets) in order to reveal certain information? Alternatively, what associations need to be protected in order to conceal certain information? Finally, given policy constraints by the different stakeholders (e.g., the person who the data that describes, operational personnel, and research personnel), can dataset X be sanitized in a way that satisfies the policies of all of those people, or would certain compromises to one or more policies need to be made? If so, what?

Researchers involved:

Faculty: Students:
  • Justin Cummins (UC Davis, M.S. 2011 → Square)
  • Anhad Singh (UC Davis)

Sponsor: Institute for Information Infrastructure Protection (I3P)

Publications resulting from this project:

"Relationships in Data Sanitization: A Study in Scarlet"
Matt Bishop, Justin Cummins, Sean Peisert, Bhume Bhumitarana, Anhad Singh, Deborah Agarwal, Deborah Frincke, and Michael Hogarth,
Proceedings of the 2010 New Security Paradigms Workshop (NSPW), pp. 151–164
Concord, MA, September 21–23, 2010.

Personal use of the material posted on this page is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the original publishers.

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Last modified: Sunday, 20-Oct-2013 19:38:28 PDT