Communication complexity of secure distributed computation in the presence of noise

DOI10.1109/18.144700MaRDI QIDQ4014135zbMATH OpenOpenAlexFDO

Authors Anthony Ephremides, Eytan 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

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Distributed algorithms (68W15) Communication theory (94A05)

Recommendations

• On the communication complexity of secure computation
• Communication and Randomness Lower Bounds for Secure Computation
• Secure computation from elastic noisy channels
• The communication complexity of non-signaling distributions
• The Communication Complexity of Non-signaling Distributions
• Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
• On the message complexity of secure multiparty computation
• The communication complexity for decentralized evaluation of functions
• Communication complexity of the secret key agreement in algorithmic information theory
• The broadcast message complexity of secure multiparty computation

Cited in

(8)

• Communication protocols for secure distributed computation of binary functions.
• Privacy in non-private environments
• Communication and Randomness Lower Bounds for Secure Computation
• Private interactive communication across an adversarial channel
• The Communication Complexity of Non-signaling Distributions
• Thermodynamic aspects of confidentiality
• Making Asynchronous Distributed Computations Robust to Channel Noise
• A simple model of secure public communication

This page was built for publication: Communication complexity of secure distributed computation in the presence of noise

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