Privacy, additional information and communication

DOI10.1109/18.265501MaRDI QIDQ4307471zbMATH OpenOpenAlexFDO

Authors Benny Chor, Eyal Kushilevitz, Alon Orlitsky, 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

additional informationcommunication complexityprivate distributed protocolsrounds complexity

Mathematics Subject Classification ID

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

Recommendations

• Revealing Additional Information in Two-Party Computations
• New Lower Bounds for Privacy in Communication Protocols
• scientific article; zbMATH DE number 4191075
• Privacy and Communication Complexity

Cited in

(15)

• On the computational complexities of three problems related to a privacy measure for large networks under active attack
• Privacy in non-private environments
• The hardness of being private
• Lower bounds on information complexity via zero-communication protocols and applications
• Interactive Information Complexity
• Privacy and Communication Complexity
• scientific article; zbMATH DE number 1024014 (Why is no real title available?)
• Coding for computing
• Interactive information complexity
• scientific article; zbMATH DE number 7559107 (Why is no real title available?)
• Revealing Additional Information in Two-Party Computations
• Communication Lower Bounds Via the Chromatic Number
• An information statistics approach to data stream and communication complexity
• Communication and information complexity
• On communication protocols that compute almost privately

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

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