A zero-one law for Boolean privacy
SIAM Journal on Discrete Mathematics
Privacy and communication complexity
SIAM Journal on Discrete Mathematics
Communication complexity
Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Private approximation of NP-hard functions
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Auctions with Severely Bounded Communication
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Private approximation of search problems
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
On the Existence of Unconditionally Privacy-Preserving Auction Protocols
ACM Transactions on Information and System Security (TISSEC)
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Informational overhead of incentive compatibility
Proceedings of the 9th ACM conference on Electronic commerce
Universally utility-maximizing privacy mechanisms
Proceedings of the forty-first annual ACM symposium on Theory of computing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
The communication complexity of private value single-item auctions
Operations Research Letters
Proceedings of the 12th ACM conference on Electronic commerce
Towards a mechanism for incentivating privacy
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
On communication protocols that compute almost privately
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Approximately optimal auctions for selling privacy when costs are correlated with data
Proceedings of the 13th ACM Conference on Electronic Commerce
On communication protocols that compute almost privately
Theoretical Computer Science
Is privacy compatible with truthfulness?
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Take it or leave it: running a survey when privacy comes at a cost
WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Truthful mechanisms for agents that value privacy
Proceedings of the fourteenth ACM conference on Electronic commerce
Privacy and coordination: computing on databases with endogenous participation
Proceedings of the fourteenth ACM conference on Electronic commerce
Analysis and optimization of multi-dimensional percentile mechanisms
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
ACM Transactions on Computation Theory (TOCT)
Hi-index | 0.00 |
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 privacy 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 2ndprice 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.