(ε, 0)-Secure Message Transmission

Author

Tuhin, Mohammed Ashraful Alam ; Shi, Hongsong ; Safavi-Naini, Rei

Author_Institution

Dept. of Comput. Sci., Univ. of Calgary, Calgary, AB

fYear

2009

fDate

13-15 May 2009

Firstpage

152

Lastpage

156

Abstract

In secure message transmission (SMT) protocol a sender S can send a message m to a receiver R in a dasiaprivatepsila and dasiareliablepsila way. S and R are connected by n channels where at most t of them can be fully controlled by an adaptive adversary with unlimited computational power. In this paper, noting the similarity between the privacy goal of SMT and an encryption function, we introduce a new definition for privacy of SMT systems which is inspired by the definition of semantic security in encryption. We show the relationship between this new definition and the previously known one, and propose an efficient 1-round protocol that is secure under the new definition and insecure under the previous one. The protocol has a better transmission rate compared to all known 1-round protocols in the previous model. We discuss our results and show how it relates to known results in this area.

Keywords

cryptography; data privacy; transport protocols; 1-round protocols; SMT systems; adaptive adversary; encryption function; privacy goal; secure message transmission protocol; semantic security; Complexity theory; Computer science; Cryptography; Drives; Power system security; Privacy; Protocols; Surface-mount technology; Telecommunication network reliability; Wires;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2009. CWIT 2009. 11th Canadian Workshop on

Conference_Location

Ottawa, ON

Print_ISBN

978-1-4244-3400-8

Electronic_ISBN

978-1-4244-3401-5

Type

conf

DOI

10.1109/CWIT.2009.5069543

Filename

5069543