Optimal one round almost perfectly secure message transmission (short paper)

Authors:
Mohammed Ashraful Alam Tuhin;Reihaneh Safavi-Naini
Affiliations:
Department of Computer Science, University of Calgary, Canada;Department of Computer Science, University of Calgary, Canada
Venue:
FC'11 Proceedings of the 15th international conference on Financial Cryptography and Data Security
Year:
2011

Citing 10
Cited 1

Completeness theorems for non-cryptographic fault-tolerant distributed computation

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Perfectly secure message transmission

Journal of the ACM (JACM)
Perfectly Secure Message Transmission Revisited

EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Robust key establishment in sensor networks

ACM SIGMOD Record
Almost Secure 1-Round Message Transmission Scheme with Polynomial-Time Message Decryption

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Almost Secure (1-Round, n-Channel) Message Transmission Scheme

Information Theoretic Security
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality

International Journal of Applied Cryptography
Asymptotically optimal two-round perfectly secure message transmission

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Simple and communication complexity efficient almost secure and perfectly secure message transmission schemes

AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa

A general construction for 1-round δ-RMT and (0, δ)-SMT

ACNS'12 Proceedings of the 10th international conference on Applied Cryptography and Network Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider 1-round almost perfectly secure message transmission protocols with optimal transmission rate, and give constructions for two levels of connectivity, n=2t+k and $n = (2+c)t, c \frac{1}{t}$ . Here n and t are the total number of wires and the number of corrupted wires, respectively, and k and c are constants. The first protocol has a modular construction that with appropriate instantiations of each module results in optimal protocols for n=2t+k. The second protocol is the first construction for optimal protocol when n=(2+c)t.