Abstract
Users today are concerned about how their information is collected, stored and used by Internet sites. Privacy policy languages, such as the Platform for Privacy Preferences (P3P), allow websites to publish their privacy practices and policies in machine readable form. Currently, software agents designed to protect users' privacy follow a "take it or leave it" approach when evaluating these privacy policies. This approach is inflexible and gives the server ultimate control over the privacy of web transactions. Privacy policy negotiation is one approach to leveling the playing field by allowing a client to negotiate with a server to determine how that server collects and uses the client's data. We present a privacy policy negotiation protocol, "Or Best Offer", that includes a formal model for specifying privacy preferences and reasoning about privacy policies. The protocol is guaranteed to terminate within three rounds of negotiation while producing policies that are Pareto-optimal, and thus fair to both parties. That is, it remains fair to both the client and the server.
Degree
MS
College and Department
Physical and Mathematical Sciences; Computer Science
Rights
http://lib.byu.edu/about/copyright/
BYU ScholarsArchive Citation
Walker, Daniel David, "Or Best Offer: A Privacy Policy Negotiation Protocol" (2007). Theses and Dissertations. 1016.
https://scholarsarchive.byu.edu/etd/1016
Date Submitted
2007-07-12
Document Type
Thesis
Handle
http://hdl.lib.byu.edu/1877/etd1953
Keywords
privacy, p3p, privacy policies, privacy policy negotiation, utility, Pareto-optimality, Pareto-efficiency, policy, negotiation, protocol
Language
English