@conference {14679,
	title = {Dynamic Enforcement of Knowledge-Based Security Policies},
	booktitle = {Computer Security Foundations Symposium (CSF), 2011 IEEE 24th},
	year = {2011},
	month = {2011/06/27/29},
	pages = {114 - 128},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier{\textquoteright}s (possibly increased) knowledge given the results. Limiting knowledge is the goal of existing information release policies that employ mechanisms such as noising, anonymization, and redaction. Knowledge-based policies are more general: they increase flexibility by not fixing the means to restrict information flow. We enforce a knowledge-based policy by explicitly tracking a model of a querier{\textquoteright}s belief about secret data, represented as a probability distribution, and denying any query that could increase knowledge above a given threshold. We implement query analysis and belief tracking via abstract interpretation using a novel probabilistic polyhedral domain, whose design permits trading off precision with performance while ensuring estimates of a querier{\textquoteright}s knowledge are sound. Experiments with our implementation show that several useful queries can be handled efficiently, and performance scales far better than would more standard implementations of probabilistic computation based on sampling.},
	keywords = {abstract interpretation, belief networks, belief tracking, Data models, dynamic enforcement, Facebook, information flow, knowledge based systems, knowledge-based security, knowledge-based security policy, privacy, probabilistic computation, probabilistic logic, probabilistic polyhedral domain, probabilistic polyhedron, probability, query analysis, Security, security of data, semantics, Waste materials},
	isbn = {978-1-61284-644-6},
	doi = {10.1109/CSF.2011.15},
	author = {Mardziel,P. and Magill,S. and Hicks, Michael W. and Srivatsa,M.}
}
@article {15262,
	title = {Achieving anonymity via clustering},
	journal = {ACM Trans. Algorithms},
	volume = {6},
	year = {2010},
	month = {2010/07//},
	pages = {49:1{\textendash}49:19 - 49:1{\textendash}49:19},
	abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of deidentifying records is to remove identifying fields such as social security number, name, etc. However, recent research has shown that a large fraction of the U.S. population can be identified using nonkey attributes (called quasi-identifiers) such as date of birth, gender, and zip code. The k-anonymity model protects privacy via requiring that nonkey attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a prespecified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, that is, deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.},
	keywords = {anonymity, Approximation algorithms, clustering, privacy},
	isbn = {1549-6325},
	doi = {10.1145/1798596.1798602},
	url = {http://doi.acm.org/10.1145/1798596.1798602},
	author = {Aggarwal,Gagan and Panigrahy,Rina and Feder,Tom{\'a}s and Thomas,Dilys and Kenthapadi,Krishnaram and Khuller, Samir and Zhu,An}
}
@conference {15918,
	title = {Sectored Random Projections for Cancelable Iris Biometrics},
	booktitle = {2010 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP)},
	year = {2010},
	month = {2010/03//},
	pages = {1838 - 1841},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {Privacy and security are essential requirements in practical biometric systems. In order to prevent the theft of biometric patterns, it is desired to modify them through revocable and non invertible transformations called Cancelable Biometrics. In this paper, we propose an efficient algorithm for generating a Cancelable Iris Biometric based on Sectored Random Projections. Our algorithm can generate a new pattern if the existing one is stolen, retain the original recognition performance and prevent extraction of useful information from the transformed patterns. Our method also addresses some of the drawbacks of existing techniques and is robust to degradations due to eyelids and eyelashes.},
	keywords = {biometric pattern, Biometrics, Cancelable Biometrics, cancelable iris biometrics, data mining, data privacy, Degradation, Eyelashes, Eyelids, Iris, iris recognition, pattern recognition, privacy, random processes, Random Projections, Robustness, sectored random projection, Secure Biometrics, Security, security of data},
	isbn = {978-1-4244-4295-9},
	doi = {10.1109/ICASSP.2010.5495383},
	author = {Pillai,J.K. and Patel, Vishal M. and Chellapa, Rama and Ratha,N. K}
}
@conference {19029,
	title = {Controlling data in the cloud: outsourcing computation without outsourcing control},
	series = {CCSW {\textquoteright}09},
	year = {2009},
	month = {2009},
	pages = {85 - 90},
	publisher = {ACM},
	organization = {ACM},
	abstract = {Cloud computing is clearly one of today{\textquoteright}s most enticing technology areas due, at least in part, to its cost-efficiency and flexibility. However, despite the surge in activity and interest, there are significant, persistent concerns about cloud computing that are impeding momentum and will eventually compromise the vision of cloud computing as a new IT procurement model. In this paper, we characterize the problems and their impact on adoption. In addition, and equally importantly, we describe how the combination of existing research thrusts has the potential to alleviate many of the concerns impeding adoption. In particular, we argue that with continued research advances in trusted computing and computation-supporting encryption, life in the cloud can be advantageous from a business intelligence standpoint over the isolated alternative that is more common today.},
	keywords = {Cloud computing, privacy, Security},
	isbn = {978-1-60558-784-4},
	url = {http://doi.acm.org/10.1145/1655008.1655020},
	author = {Chow, Richard and Golle, Philippe and Jakobsson, Markus and Elaine Shi and Staddon, Jessica and Masuoka, Ryusuke and Molina,Jesus}
}
@conference {12237,
	title = {Persona: an online social network with user-defined privacy},
	booktitle = {Proceedings of the ACM SIGCOMM 2009 conference on Data communication},
	series = {SIGCOMM {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {135 - 146},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Online social networks (OSNs) are immensely popular, with some claiming over 200 million users. Users share private content, such as personal information or photographs, using OSN applications. Users must trust the OSN service to protect personal information even as the OSN provider benefits from examining and sharing that information. We present Persona, an OSN where users dictate who may access their information. Persona hides user data with attribute-based encryption (ABE), allowing users to apply fine-grained policies over who may view their data. Persona provides an effective means of creating applications in which users, not the OSN, define policy over access to private data. We demonstrate new cryptographic mechanisms that enhance the general applicability of ABE. We show how Persona provides the functionality of existing online social networks with additional privacy benefits. We describe an implementation of Persona that replicates Facebook applications and show that Persona provides acceptable performance when browsing privacy-enhanced web pages, even on mobile devices.},
	keywords = {ABE, Facebook, OSN, persona, privacy, social networks},
	isbn = {978-1-60558-594-9},
	doi = {10.1145/1592568.1592585},
	url = {http://doi.acm.org/10.1145/1592568.1592585},
	author = {Baden,Randy and Bender,Adam and Spring, Neil and Bhattacharjee, Bobby and Starin,Daniel}
}
@conference {14448,
	title = {To join or not to join: the illusion of privacy in social networks with mixed public and private user profiles},
	booktitle = {Proceedings of the 18th international conference on World wide web},
	series = {WWW {\textquoteright}09},
	year = {2009},
	month = {2009///},
	pages = {531 - 540},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {In order to address privacy concerns, many social media websites allow users to hide their personal profiles from the public. In this work, we show how an adversary can exploit an online social network with a mixture of public and private user profiles to predict the private attributes of users. We map this problem to a relational classification problem and we propose practical models that use friendship and group membership information (which is often not hidden) to infer sensitive attributes. The key novel idea is that in addition to friendship links, groups can be carriers of significant information. We show that on several well-known social media sites, we can easily and accurately recover the information of private-profile users. To the best of our knowledge, this is the first work that uses link-based and group-based classification to study privacy implications in social networks with mixed public and private user profiles.},
	keywords = {attribute inference, groups, privacy, social networks},
	isbn = {978-1-60558-487-4},
	doi = {10.1145/1526709.1526781},
	url = {http://doi.acm.org/10.1145/1526709.1526781},
	author = {Zheleva,Elena and Getoor, Lise}
}
@conference {14450,
	title = {Preserving the privacy of sensitive relationships in graph data},
	booktitle = {Proceedings of the 1st ACM SIGKDD international conference on Privacy, security, and trust in KDD},
	series = {PinKDD{\textquoteright}07},
	year = {2008},
	month = {2008///},
	pages = {153 - 171},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	address = {Berlin, Heidelberg},
	abstract = {In this paper, we focus on the problem of preserving the privacy of sensitive relationships in graph data. We refer to the problem of inferring sensitive relationships from anonymized graph data as link reidentification. We propose five different privacy preservation strategies, which vary in terms of the amount of data removed (and hence their utility) and the amount of privacy preserved. We assume the adversary has an accurate predictive model for links, and we show experimentally the success of different link re-identification strategies under varying structural characteristics of the data.},
	keywords = {anonymization, graph data, identification, link mining, noisy-or, privacy, social network analysis},
	isbn = {3-540-78477-2, 978-3-540-78477-7},
	url = {http://dl.acm.org/citation.cfm?id=1793474.1793485},
	author = {Zheleva,Elena and Getoor, Lise}
}
@conference {15244,
	title = {Achieving anonymity via clustering},
	booktitle = {Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems},
	series = {PODS {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {153 - 162},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {Publishing data for analysis from a table containing personal records, while maintaining individual privacy, is a problem of increasing importance today. The traditional approach of de-identifying records is to remove identifying fields such as social security number, name etc. However, recent research has shown that a large fraction of the US population can be identified using non-key attributes (called quasi-identifiers) such as date of birth, gender, and zip code [15]. Sweeney [16] proposed the k-anonymity model for privacy where non-key attributes that leak information are suppressed or generalized so that, for every record in the modified table, there are at least k-1 other records having exactly the same values for quasi-identifiers. We propose a new method for anonymizing data records, where quasi-identifiers of data records are first clustered and then cluster centers are published. To ensure privacy of the data records, we impose the constraint that each cluster must contain no fewer than a pre-specified number of data records. This technique is more general since we have a much larger choice for cluster centers than k-Anonymity. In many cases, it lets us release a lot more information without compromising privacy. We also provide constant-factor approximation algorithms to come up with such a clustering. This is the first set of algorithms for the anonymization problem where the performance is independent of the anonymity parameter k. We further observe that a few outlier points can significantly increase the cost of anonymization. Hence, we extend our algorithms to allow an ε fraction of points to remain unclustered, i.e., deleted from the anonymized publication. Thus, by not releasing a small fraction of the database records, we can ensure that the data published for analysis has less distortion and hence is more useful. Our approximation algorithms for new clustering objectives are of independent interest and could be applicable in other clustering scenarios as well.},
	keywords = {anonymity, Approximation algorithms, clustering, privacy},
	isbn = {1-59593-318-2},
	doi = {10.1145/1142351.1142374},
	url = {http://doi.acm.org/10.1145/1142351.1142374},
	author = {Aggarwal,Gagan and Feder,Tom{\'a}s and Kenthapadi,Krishnaram and Khuller, Samir and Panigrahy,Rina and Thomas,Dilys and Zhu,An}
}
@article {16084,
	title = {Shared family calendars: Promoting symmetry and accessibility},
	journal = {ACM Trans. Comput.-Hum. Interact.},
	volume = {13},
	year = {2006},
	month = {2006/09//},
	pages = {313 - 346},
	abstract = {We describe the design and use of a system facilitating the sharing of calendar information between remotely located, multi-generational family members. Most previous work in this area involves software enabling younger family members to monitor their parents. We have found, however, that older adults are equally if not more interested in the activities of younger family members. The major obstacle preventing them from participating in information sharing is the technology itself. Therefore, we developed a multi-layered interface approach that offers simple interaction to older users. In our system, users can choose to enter information into a computerized calendar or write it by hand on digital paper calendars. All of the information is automatically shared among everyone in the distributed family. By making the interface more accessible to older users, we promote symmetrical sharing of information among both older and younger family members. We present our participatory design process, describe the user interface, and report on an exploratory field study in three households of an extended family.},
	keywords = {calendar, digital paper, elderly, family technology, Home, layered interface, privacy, universal usability},
	isbn = {1073-0516},
	doi = {10.1145/1183456.1183458},
	url = {http://doi.acm.org/10.1145/1183456.1183458},
	author = {Plaisant, Catherine and Clamage,Aaron and Hutchinson,Hilary Browne and Bederson, Benjamin B. and Druin, Allison}
}
@article {12088,
	title = {The dangers of mitigating security design flaws: a wireless case study},
	journal = {IEEE Security \& Privacy},
	volume = {1},
	year = {2003},
	month = {2003/02//Jan},
	pages = {28 - 36},
	abstract = {Mitigating design flaws often provides the only means to protect legacy equipment, particularly in wireless local area networks. A synchronous active attack against the wired equivalent privacy protocol demonstrates how mitigating one flaw or attack can facilitate another.},
	keywords = {Communication system security, computer security, cryptography, design flaw mitigation, Dictionaries, legacy equipment, privacy, Protection, Protocols, security design flaws, security of data, synchronous active attack, telecommunication security, Telecommunication traffic, wired equivalent privacy protocol, Wireless LAN, wireless local area networks, Wireless networks},
	isbn = {1540-7993},
	doi = {10.1109/MSECP.2003.1176993},
	author = {Petroni,N. L. and Arbaugh, William A.}
}
@conference {17227,
	title = {Improving Web-based civic information access: a case study of the 50 US states},
	booktitle = {2002 International Symposium on Technology and Society, 2002. (ISTAS{\textquoteright}02)},
	year = {2002},
	month = {2002///},
	pages = {275 - 282},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {An analysis of the home pages of all fifty US states reveals great variety in key design features that influence efficacy. Some states had excessively large byte counts that would slow users connected by commonly-used 56 K modems. Many web sites had low numbers of or poorly organized links that would make it hard for citizens to find what they were interested in. Features such as search boxes, privacy policies, online help, or contact information need to be added by several states. Our analysis concludes with ten recommendations and finds many further opportunities for individual states to improve their Websites. However still greater benefits will come through collaboration among the states that would lead to consistency, appropriate tagging, and common tools.},
	keywords = {Computer aided software engineering, Computer science, contact information, Educational institutions, government data processing, Guidelines, home page design features, information resources, Laboratories, Modems, Navigation, online help, privacy, privacy policies, search boxes, Tagging, Uniform resource locators, US states, USA, User interfaces, Web sites, Web-based civic information access},
	isbn = {0-7803-7284-0},
	doi = {10.1109/ISTAS.2002.1013826},
	author = {Ceaparu,I. and Shneiderman, Ben}
}
@conference {17243,
	title = {Interacting with identification technology: can it make us more secure?},
	booktitle = {CHI {\textquoteright}02 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}02},
	year = {2002},
	month = {2002///},
	pages = {564 - 565},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	keywords = {Biometrics, civil liberties, face recognition, national id card, privacy, Security},
	isbn = {1-58113-454-1},
	doi = {10.1145/506443.506484},
	url = {http://doi.acm.org/10.1145/506443.506484},
	author = {Scholtz,Jean and Johnson,Jeff and Shneiderman, Ben and Hope-Tindall,Peter and Gosling,Marcus and Phillips,Jonathon and Wexelblat,Alan}
}
@conference {17642,
	title = {P5 : a protocol for scalable anonymous communication},
	booktitle = {2002 IEEE Symposium on Security and Privacy, 2002. Proceedings},
	year = {2002},
	month = {2002///},
	pages = {58 - 70},
	publisher = {IEEE},
	organization = {IEEE},
	abstract = {We present a protocol for anonymous communication over the Internet. Our protocol, called P5 (peer-to-peer personal privacy protocol) provides sender-, receiver-, and sender-receiver anonymity. P5 is designed to be implemented over current Internet protocols, and does not require any special infrastructure support. A novel feature of P5 is that it allows individual participants to trade-off degree of anonymity for communication efficiency, and hence can be used to scalably implement large anonymous groups. We present a description of P5, an analysis of its anonymity and communication efficiency, and evaluate its performance using detailed packet-level simulations.},
	keywords = {Broadcasting, communication efficiency, Computer science, cryptography, data privacy, Educational institutions, Internet, large anonymous groups, P5 protocol, packet-level simulations, Particle measurements, Peer to peer computing, peer-to-peer personal privacy protocol, privacy, Protocols, receiver anonymity, scalable anonymous communication, security of data, sender anonymity, sender-receiver anonymity, Size measurement, telecommunication security},
	isbn = {0-7695-1543-6},
	doi = {10.1109/SECPRI.2002.1004362},
	author = {Sherwood,R. and Bhattacharjee, Bobby and Srinivasan, Aravind}
}
@conference {17443,
	title = {Trust me, I{\textquoteright}m accountable: trust and accountability online},
	booktitle = {CHI {\textquoteright}99 extended abstracts on Human factors in computing systems},
	series = {CHI EA {\textquoteright}99},
	year = {1999},
	month = {1999///},
	pages = {79 - 80},
	publisher = {ACM},
	organization = {ACM},
	address = {New York, NY, USA},
	abstract = {We live in an increasingly wired world. According to Robert Putnam, people are spending less time in persistent personal face to face interactions and more time in pursuits such as watching TV and using the Internet. At the same time, independently measured "social capital" -- the extent to which we trust and work for a common good -- is declining. In this panel, we explore: the impacts of electronic media on trust and accountability; whether and how electronic media can be designed and used to increase deserved trust and accountability; the relationship between protecting privacy and increasing the efficacy of communication; and how people{\textquoteright}s tendency to treat computers as social actors impacts these issues. In brief, how can modern technology enhance humanity{\textquoteright}s humanity?},
	keywords = {accountability, anonymity, Communication, computers and society, ethics, Internet, media effects, privacy, Reciprocity, repute, social actors, social capital, social impacts, trust, value-sensitive design, wired world, WWW},
	isbn = {1-58113-158-5},
	doi = {10.1145/632716.632766},
	url = {http://doi.acm.org/10.1145/632716.632766},
	author = {Friedman,Batya and Thomas,John C. and Grudin,Jonathan and Nass,Clifford and Nissenbaum,Helen and Schlager,Mark and Shneiderman, Ben}
}
