@conference {18677,
	title = {How secure are networked office devices?},
	year = {2011},
	month = {2011/06//},
	pages = {465 - 472},
	abstract = {Many office devices have a history of being networked (such as printers) and others without the same past are increasingly becoming networked (such as photocopiers). The modern networked versions of previously non-networked devices have much in common with traditional networked servers in terms of features and functions. While an organization may have policies and procedures for securing traditional network servers, securing networked office devices providing similar services can easily be overlooked. In this paper we present an evaluation of privacy and security risks found when examining over 1,800 networked office devices connected to a large university network. We use the STRIDE threat model to categorize threats and vulnerabilities and then we group the devices according to assessed risk from the perspective of the university. We found that while steps had been taken to secure some devices, many were using default or unsecured configurations.},
	keywords = {computer network security, data privacy, networked office device security, privacy risk assessment, Risk management, security risk assessment, STRIDE threat model, university network},
	doi = {10.1109/DSN.2011.5958259},
	author = {Condon,E. and Cummins,E. and Afoulki,Z. and Michel Cukier}
}
@conference {19042,
	title = {Privacy settings from contextual attributes: A case study using Google Buzz},
	year = {2011},
	month = {2011},
	pages = {257 - 262},
	abstract = {Social networks provide users with privacy settings to control what information is shared with connections and other users. In this paper, we analyze factors influencing changes in privacy-related settings in the Google Buzz social network. Specifically, we show statistics on contextual data related to privacy settings that are derived from crawled datasets and analyze the characteristics of users who changed their privacy settings. We also investigate potential neighboring effects among such users.},
	keywords = {contextual attributes, data privacy, Google Buzz, privacy settings, social networking (online), social networks, Statistics},
	author = {Mashima, D. and Elaine Shi and Chow, R. and Sarkar, P. and Li,C. and Song,D.}
}
@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 {19045,
	title = {TACKing Together Efficient Authentication, Revocation, and Privacy in VANETs},
	year = {2009},
	month = {2009},
	pages = {1 - 9},
	abstract = {Vehicular ad hoc networks (VANETs) require a mechanism to help authenticate messages, identify valid vehicles, and remove malevolent vehicles. A public key infrastructure (PKI) can provide this functionality using certificates and fixed public keys. However, fixed keys allow an eavesdropper to associate a key with a vehicle and a location, violating drivers{\textquoteright} privacy. In this work we propose a VANET key management scheme based on temporary anonymous certified keys (TACKs). Our scheme efficiently prevents eavesdroppers from linking a vehicle{\textquoteright}s different keys and provides timely revocation of misbehaving participants while maintaining the same or less overhead for vehicle-to-vehicle communication as the current IEEE 1609.2 standard for VANET security.},
	keywords = {ad hoc networks, data privacy, eavesdropper, IEEE 1609.2 standard, Message authentication, mobile radio, public key cryptography, public key infrastructure, remove malevolent vehicle, telecommunication security, temporary anonymous certified key, valid vehicle identification, VANET key management, VANET security, vehicle-to-vehicle communication, Vehicles, vehicular ad hoc network},
	author = {Studer, A. and Elaine Shi and Bai, Fan and Perrig, A.}
}
@article {17203,
	title = {Human Responsibility for Autonomous Agents},
	journal = {IEEE Intelligent Systems},
	volume = {22},
	year = {2007},
	month = {2007/04//March},
	pages = {60 - 61},
	abstract = {Automated or autonomous systems can sometimes fail harmlessly, but they can also destroy data, compromise privacy, and consume resources, such as bandwidth or server capacity. What{\textquoteright}s more troubling is that automated systems embedded in vital systems can cause financial losses, destruction of property, and loss of life. Controlling these dangers will increase trust while enabling broader use of these systems with higher degrees of safety. Obvious threats stem from design errors and software bugs, but we can{\textquoteright}t overlook mistaken assumptions by designers, unanticipated actions by humans, and interference from other computerized systems. This article is part of a special issue on Interacting with Autonomy.},
	keywords = {Automatic control, Autonomous agents, autonomous systems, Bandwidth, Computer bugs, Computer errors, Control systems, data privacy, Human-computer interaction, HUMANS, Robots, Safety, Software design},
	isbn = {1541-1672},
	doi = {10.1109/MIS.2007.32},
	author = {Shneiderman, Ben}
}
@conference {19036,
	title = {Multi-Dimensional Range Query over Encrypted Data},
	year = {2007},
	month = {2007},
	pages = {350 - 364},
	abstract = {We design an encryption scheme called multi-dimensional range query over encrypted data (MRQED), to address the privacy concerns related to the sharing of network audit logs and various other applications. Our scheme allows a network gateway to encrypt summaries of network flows before submitting them to an untrusted repository. When network intrusions are suspected, an authority can release a key to an auditor, allowing the auditor to decrypt flows whose attributes (e.g., source and destination addresses, port numbers, etc.) fall within specific ranges. However, the privacy of all irrelevant flows are still preserved. We formally define the security for MRQED and prove the security of our construction under the decision bilinear Diffie-Hellman and decision linear assumptions in certain bilinear groups. We study the practical performance of our construction in the context of network audit logs. Apart from network audit logs, our scheme also has interesting applications for financial audit logs, medical privacy, untrusted remote storage, etc. In particular, we show that MRQED implies a solution to its dual problem, which enables investors to trade stocks through a broker in a privacy-preserving manner.},
	keywords = {auditing, cryptography, data privacy, decision bilinear Diffie-Hellman, decision linear assumptions, encrypted data, multi-dimensional range query, network audit logs, network gateway, network intrusions},
	author = {Elaine Shi and Bethencourt, J. and Chan, T.-H.H. and Song, Dawn and Perrig, A.}
}
@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}
}
