Approximate privacy

Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira
2010 Proceedings of the 11th ACM conference on Electronic commerce - EC '10  
Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of online sensitive data about individuals and organizations. Consequently, concern about the privacy of these data has become a top priority, particularly those data that are created and used in electronic commerce. Despite many careful formulations and extensive study, there are still open questions about the feasibility of maintaining meaningful
more » ... in realistic networked environments. We formulate communication-complexity-based definitions, both worst-case and average-case, of a problem's privacy-approximation ratio. We use our definitions to investigate the extent to which approximate privacy is achievable in many well studied contexts: the 2 nd -price Vickrey auction [20], the millionaires problem of Yao [22] , the provisioning of a public good, and also set disjointness and set intersection. We present both positive and negative results and many interesting directions for future research.
doi:10.1145/1807342.1807369 dblp:conf/sigecom/FeigenbaumJS10 fatcat:4jpjlwlbere3jmmmpyc2uirg6u