Header menu link for other important links
Brief Announcement: Efficient Perfectly Secure Communication over Synchronous Networks
Published in
Volume: 22
The achieving of perfectly secure communication over synchronous networks was studied. In this regard, a communication problem related with a connected synchronous 2-way network was discussed, such that the under study work improved the bit-complexity. The discussed protocols communicated the bits for a specified bit secret message with optimum fault-tolerance. The relevant theorems and claims made to improve the bit-complexity were proved.
About the journal
JournalProceedings of the Annual ACM Symposium on Principles of Distributed Computing
Open AccessNo
Concepts (9)
  •  related image
    Computational complexity
  •  related image
  •  related image
    Data communication systems
  •  related image
    Fault tolerant computer systems
  •  related image
    Network protocols
  •  related image
    Theorem proving
  •  related image
    Secure communication
  •  related image
  •  related image
    Security of data