Approximate privacy: foundations and quantification

DOI10.1145/2601067MaRDI QIDQ4962149zbMATH OpenOpenAlexFDO

Authors Joan Feigenbaum, Aaron D. Jaggard, Michael Schapira

Publication date 30 October 2018

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2601067

zbMATH Keywords

approximate privacybisection auction

Mathematics Subject Classification ID

Network protocols (68M12) Analysis of algorithms and problem complexity (68Q25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• The hardness of being private
• On communication protocols that compute almost privately
• On communication protocols that compute almost privately
• Selling privacy at auction
• Near-optimal private approximation protocols via a black box transformation

Cited in

(11)

• Selling privacy at auction
• On the computational complexities of three problems related to a privacy measure for large networks under active attack
• Computing (and Life) Is All about Tradeoffs
• The hardness of being private
• On communication protocols that compute almost privately
• PRIVACY RISK ASSESSMENT WITH BOUNDS DEDUCED FROM BOUNDS
• Lower bounds on information complexity via zero-communication protocols and applications
• Private Policy Negotiation
• Satisfiability modulo counting
• Near-optimal private approximation protocols via a black box transformation
• On communication protocols that compute almost privately

This page was built for publication: Approximate privacy: foundations and quantification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4962149)