On communication protocols that compute almost privately

DOI10.1016/J.TCS.2012.07.008zbMath1252.68037OpenAlexW2155189235MaRDI QIDQ714841

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

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.008

zbMATH Keywords

tilingbinary space partitionapproximate privacymulti-party communication

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network protocols (68M12)

Related Items (1)

On the computational complexities of three problems related to a privacy measure for large networks under active attack

Uses Software

• PrivateLR

Cites Work

• Unnamed Item
• The private value single item bisection auction
• Efficient binary space partitions for hidden-surface removal and solid modeling
• On the optimal binary plane partition for sets of isothetic rectangles
• The communication complexity of private value single-item auctions
• Exact Size of Binary Space Partitionings and Improved Rectangle Tiling Algorithms
• Optimal binary space partitions for orthogonal objects
• Privacy and Communication Complexity
• Privacy, additional information and communication
• Communication Complexity
• A Zero-One Law for Boolean Privacy
• Differential Privacy

This page was built for publication: On communication protocols that compute almost privately