Get all the updates for this publication
Conferences
Brief Announcement: Efficient Perfectly Secure Communication over Synchronous NetworksPublished in
2003
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.
Content may be subject to copyright.
Related Papers (3)
About the journal
| Journal | Proceedings of the Annual ACM Symposium on Principles of Distributed Computing |
|---|---|
| Open Access | No |
Authors (1)
C Pandu Rangan- Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary
- Perfectly reliable and secure communication in directed networks tolerating mixed adversary
- Optimal parallel algorithms on circular-arc graphs
- Group key establishment (GKE): Two/three party key exchange to GKE
Concepts (9)
Computational complexity- Cryptography
- Data communication systems
- Fault tolerant computer systems
- Network protocols
- Theorem proving
- Secure communication
- SYNCHRONOUS NETWORKS
- Security of data
