On communication protocols that compute almost privately

DOI10.1016/J.TCS.2012.07.008MaRDI QIDQ714841zbMATHOpenAlexFDO

Authors Marco Comi, Michael Schapira, Venkatakumar Srinivasan, Bhaskar Dasgupta

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

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

Recommendations

• On communication protocols that compute almost privately
• Approximate privacy: foundations and quantification
• The hardness of being private
• Near-optimal private approximation protocols via a black box transformation
• New Lower Bounds for Privacy in Communication Protocols

Cites work

• A Zero-One Law for Boolean Privacy
• Binary space partitions: recent developments
• Communication Complexity
• Differential Privacy
• Efficient binary space partitions for hidden-surface removal and solid modeling
• Exact size of binary space partitionings and improved rectangle tiling algorithms
• On the optimal binary plane partition for sets of isothetic rectangles
• Optimal binary space partitions for orthogonal objects
• Privacy and Communication Complexity
• Privacy, additional information and communication
• The communication complexity of private value single-item auctions
• The private value single item bisection auction

Cited in

(15)

• New Lower Bounds for Privacy in Communication Protocols
• scientific article; zbMATH DE number 6829278 (Why is no real title available?)
• The hardness of being private
• Theory of Cryptography
• A communication-privacy tradeoff for modular addition
• Communication and Randomness Lower Bounds for Secure Computation
• On query-to-communication lifting for adversary bounds
• MPClan: protocol suite for privacy-conscious computations
• On the computational complexities of three problems related to a privacy measure for large networks under active attack
• Private computation: \(k\)-connected versus 1-connected networks
• On communication protocols that compute almost privately
• Approximate privacy: foundations and quantification
• scientific article; zbMATH DE number 1962807 (Why is no real title available?)
• The price of low communication in secure multi-party computation
• Quantum and approximate privacy

Describes a project that uses

Uses Software

• PrivateLR

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

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