Approximate Privacy

DOI10.1145/2601067zbMath1398.68049OpenAlexW2137912742MaRDI QIDQ4962149

Michael Schapira, Joan Feigenbaum, Aaron D. Jaggard

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

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

Related Items (3)

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications ⋮ The Hardness of Being Private ⋮ Computing (and Life) Is All about Tradeoffs

This page was built for publication: Approximate Privacy