Communication complexity of secure distributed computation in the presence of noise

DOI10.1109/18.144700zbMath0775.94018MaRDI QIDQ4014135

Anthony Ephremides, Eytan H. Modiano

Publication date: 11 October 1992

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

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

Mathematics Subject Classification ID

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

94A05: Communication theory

68W15: Distributed algorithms

Related Items

Communication protocols for secure distributed computation of binary functions., Privacy in non-private environments