On communication protocols that compute almost privately
From MaRDI portal
Publication:714841
Recommendations
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
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)