On perfectly secure communication over arbitrary networks

DOI10.1145/571825.571858zbMath1292.68008MaRDI 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 security; secure communication; secure multiparty computation; adversary structures

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68M12: Network protocols

Related Items

Cryptanalysis of Secure Message Transmission Protocols with Feedback, 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?, Round-efficient perfectly secure message transmission scheme against general adversary, Oblivious transfer in incomplete networks, Another step towards realizing random oracles: non-malleable point obfuscation, On minimal connectivity requirements for secure message transmission in directed networks, On private computation in incomplete networks, Is information-theoretic topology-hiding computation possible?, Reliable broadcast with respect to topology knowledge, Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity, Secure Message Transmission in Asynchronous Directed Graphs, Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary