Efficient perfectly secure message transmission in synchronous networks
From MaRDI portal
Publication:1917093
DOI10.1006/INCO.1996.0033zbMath0856.68023OpenAlexW1980461136MaRDI 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
Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (18)
Oblivious transfer in incomplete networks ⋮ Perfectly reliable message transmission ⋮ Perfectly Secure Message Transmission in Two Rounds ⋮ Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary ⋮ Secure message transmission in asynchronous networks ⋮ On private computation in incomplete networks ⋮ Making Asynchronous Distributed Computations Robust to Channel Noise ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Secure Message Transmission by Public Discussion: A Brief Survey ⋮ Efficient reliable communication over partially authenticated networks ⋮ On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks ⋮ Synchronous perfectly secure message transmission with optimal asynchronous fallback guarantees ⋮ Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary ⋮ Round-efficient perfectly secure message transmission scheme against general adversary ⋮ Secure Message Transmission in Asynchronous Directed Graphs ⋮ Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
This page was built for publication: Efficient perfectly secure message transmission in synchronous networks
