On communication protocols that compute almost privately

DOI10.1016/J.TCS.2012.07.008zbMATH Open1252.68037OpenAlexW2155189235MaRDI QIDQ714841FDOQ714841

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

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

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)

Cites Work

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

Cited In (13)

• Title not available (Why is that?)
• Theory of Cryptography
• On communication protocols that compute almost privately
• Private computation: \(k\)-connected versus 1-connected networks
• New Lower Bounds for Privacy in Communication Protocols
• Communication and Randomness Lower Bounds for Secure Computation
• Title not available (Why is that?)
• The price of low communication in secure multi-party computation
• On the computational complexities of three problems related to a privacy measure for large networks under active attack
• Quantum and approximate privacy
• A communication-privacy tradeoff for modular addition
• MPClan: protocol suite for privacy-conscious computations
• On query-to-communication lifting for adversary bounds

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)