Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Almost optimum t-cheater identifiable secret sharing schemes
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Optimal one round almost perfectly secure message transmission (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
A general construction for 1-round δ-RMT and (0, δ)-SMT
ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Human perfectly secure message transmission protocols and their applications
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Hi-index | 0.00 |
It is known that perfectly secure (1-round, n-channel) message transmission (MT) schemes exist if and only if n 驴 3t + 1, where t is the number of channels that the adversary can corrupt. Then does there exist an almost secure MT scheme for n = 2t + 1 ? In this paper, we first sum up a number flaws of the previous almost secure MT scheme presented at Crypto 2004. We next show an equivalence between almost secure MT schemes and secret sharing schemes with cheaters. By using our equivalence, we derive a lower bound on the communication complexity of almost secure MT schemes. Finally, we present a near optimum scheme which meets our bound approximately. This is the first construction of provably secure almost secure (1-round, n-channel) MT schemes for n = 2t + 1.