On Communication Protocols That Compute Almost Privately

DOI10.1007/978-3-642-24829-0_6zbMath1233.90089arXiv1102.1443OpenAlexW2887997641MaRDI QIDQ3095257

Marco Comi, Michael Schapira, Venkatakumar Srinivasan, Bhaskar Das Gupta

Publication date: 28 October 2011

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.1443

zbMATH Keywords

auctionscommunication protocolsapproximate privacy

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Auctions, bargaining, bidding and selling, and other market models (91B26) Network protocols (68M12)

Related Items (1)

The Hardness of Being Private

This page was built for publication: On Communication Protocols That Compute Almost Privately