Privacy, additional information and communication

DOI10.1109/18.265501zbMath0806.94001OpenAlexW1984227438MaRDI QIDQ4307471

Alon Orlitsky, Benny Chor, Eyal Kushilevitz, Reuven Bar Yehuda

Publication date: 26 October 1994

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.265501

zbMATH Keywords

communication complexityadditional informationrounds complexityprivate distributed protocols

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Communication theory (94A05)

Related Items (12)

Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications ⋮ Interactive Information Complexity ⋮ Interactive Information Complexity ⋮ A discrepancy lower bound for information complexity ⋮ An information statistics approach to data stream and communication complexity ⋮ The Hardness of Being Private ⋮ On the computational complexities of three problems related to a privacy measure for large networks under active attack ⋮ Privacy in non-private environments ⋮ Communication and information complexity ⋮ On communication protocols that compute almost privately ⋮ Unnamed Item ⋮ Communication Lower Bounds Via the Chromatic Number

This page was built for publication: Privacy, additional information and communication