Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Perfectly secure message transmission
Journal of the ACM (JACM)
Robust sharing of secrets when the dealer is honest or cheating
Journal of the ACM (JACM)
On sharing secrets and Reed-Solomon codes
Communications of the ACM
Communications of the ACM
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Perfectly Secure Message Transmission Revisited
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Possibility and complexity of probabilistic reliable communication in directed networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Unconditionally reliable message transmission in directed networks
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Brief announcement: perfectly secure message transmission in directed networks re-visited
Proceedings of the 28th ACM symposium on Principles of distributed computing
CANS'07 Proceedings of the 6th international conference on Cryptology and network security
Truly efficient 2-round perfectly secure message transmission scheme
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Asymptotically optimal two-round perfectly secure message transmission
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Perfectly Secure Message Transmission Revisited
IEEE Transactions on Information Theory
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Secure communication in multicast graphs
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Secure message transmission in asynchronous directed graphs
INDOCRYPT'11 Proceedings of the 12th international conference on Cryptology in India
Theoretical Computer Science
| Hi-index | 0.00 |
In the context of secure point-to-point message transmission in networks with minimal connectivity, previous studies showed that feedbacks from the receiver to the sender can be used to reduce the requirements of network connectivity. We observe that the way how feedbacks were used in previous work does not guarantee perfect privacy to the transmitted message, when the adversary performs a Guessing Attack. In this paper, we shall describe our new Guessing Attack to some existing protocols (in fact, we are the first to point out a flaw in the protocols of Desmedt-Wang's Eurocrypt'02 paper and of Patra-Shankar-Choudhary-Srinathan-Rangan's CANS'07 paper), and propose a scheme defending against a general adversary structure. In addition, we also show how to achieve almost perfectly secure message transmission with feedbacks when perfect reliability or perfect privacy is not strictly required.