Efficient perfectly secure message transmission in synchronous networks

DOI10.1006/inco.1996.0033zbMath0856.68023MaRDI QIDQ1917093

Hosame Abu-Amara, Hasan Md. Sayeed

Publication date: 3 February 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.0033

zbMATH Keywords

perfectly secure message transmission; synchronous networks; faulty paths

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

Related Items

Making Asynchronous Distributed Computations Robust to Channel Noise, Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary, Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary, Efficient reliable communication over partially authenticated networks, Must the communication graph of MPC protocols be an expander?, Secure message transmission in asynchronous networks, Round-efficient perfectly secure message transmission scheme against general adversary, Perfectly reliable message transmission, Oblivious transfer in incomplete networks, On private computation in incomplete networks, Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity, Secure Message Transmission by Public Discussion: A Brief Survey, Secure Message Transmission in Asynchronous Directed Graphs, Perfectly Secure Message Transmission in Two Rounds, Perfectly Secure Message Transmission Against Independent Rational Adversaries, Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary, On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks