Proceedings of CRYPTO 84 on Advances in cryptology
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
t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances 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
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Public discussion must be back and forth in secure message transmission
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Optimal one round almost perfectly secure message transmission (short paper)
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
| Hi-index | 0.00 |
The model of (r-round, n-channel) message transmission scheme (MTS) was introduced by Dolev et al.[5]. In their model, there are nchannels between a sender Sand a receiver R, and they do not share any information like keys. Swants to send a message to Rsecretly and reliably in r-round. But, there is an adversary Awho can observe and forge at most tinformation which sent through n-channels.In this paper, we propose almost secure (1-round, 3t+1 -channel) MTS. Proposed scheme has following two properties. (1) If sending message is large some degree, the communication bits for transmitting messages is much more efficient with comparing to the perfectly secure (1-round, 3t+1 -channel) MTS proposed by Dolev et.al[5]. (2) The running time of message decryption algorithm is polynomial in n.