Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
International Journal of Applied Cryptography
Optimal message transmission protocols with flexible parameters
Proceedings of the 6th ACM Symposium on Information, Computer and Communications Security
Secure message transmission by public discussion: a brief survey
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Secure message transmission with small public discussion
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
On the communication complexity of reliable and secure message transmission in asynchronous networks
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
In the perfectly secure message transmission (PSMT) problem, two synchronized non-faulty players (or processors), the Sender S and the Receiver R are connected by n wires (each of which facilitates 2-way communication); S has a message, represented by a sequence of - elements from a finite field, that he wishes to send to R; after exchanging messages in phases R should correctly obtain S's message, while an adversary listening on and actively controlling any set of t (or less) wires should have no information about S's message. Similarly, in the problem of perfect reliable message transmission (PRMT), the receiver R should correctly obtain S's message, in spite of the adversary actively controlling any set of t (or less) wires.