On perfectly secure communication over arbitrary networks

DOI10.1145/571825.571858zbMath1292.68008OpenAlexW2060169610MaRDI QIDQ5170880

M. V. N. Ashwin Kumar, Pranava R. Goundan, C. Pandu Rangan, Kannan Srinathan

Publication date: 25 July 2014

Published in: Proceedings of the twenty-first annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/571825.571858

zbMATH Keywords

information-theoretic securitysecure communicationsecure multiparty computationadversary structures

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (15)

Oblivious transfer in incomplete networks ⋮ Another step towards realizing random oracles: non-malleable point obfuscation ⋮ Reliable broadcast with respect to topology knowledge ⋮ Is information-theoretic topology-hiding computation possible? ⋮ Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity ⋮ On minimal connectivity requirements for secure message transmission in directed networks ⋮ Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary ⋮ On private computation in incomplete networks ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Cryptanalysis of Secure Message Transmission Protocols with Feedback ⋮ Efficient reliable communication over partially authenticated networks ⋮ 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: On perfectly secure communication over arbitrary networks