Optimal One Round Almost Perfectly Secure Message Transmission (Short Paper)

被引：0
|
作者：
Tuhin, Mohammed Ashraful Alam [1 ]
Safavi-Naini, Reihaneh [1 ]
机构：
[1] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada
来源：
FINANCIAL CRYPTOGRAPHY AND DATA SECURITY | 2012年 / 7035卷
关键词：
COMMUNICATION; SCHEME;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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 > 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.
引用
收藏
页码：173 / 181
页数：9
相关论文
共 45 条
  • [1] Asymptotically optimal two-round perfectly secure message transmission
    Agarwal, Saurabh
    Cramer, Ronald
    de Haan, Robbert
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2006, PROCEEDINGS, 2006, 4117 : 394 - 408
  • [2] Optimal perfectly secure message transmission
    Srinathan, K
    Narayanan, A
    Rangan, CP
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 545 - 561
  • [3] Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary
    Choudhury, Ashish
    Kurosawa, Kaoru
    Patra, Arpita
    [J]. APPLIED CRYPTOGRAPHY AND NETWORK SECURITY (ACNS 2011), 2011, 6715 : 292 - 308
  • [4] Simple and efficient single round almost perfectly secure message transmission tolerating generalized adversary
    Applied Statistics Unit, Indian Statistical Institute Kolkata India, India
    不详
    不详
    [J]. Lect. Notes Comput. Sci, (292-308):
  • [5] Towards optimal and efficient perfectly secure message transmission
    Fitzi, Matthias
    Franklin, Matthew
    Garay, Juan
    Vardhan, S. Harsha
    [J]. THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2007, 4392 : 311 - +
  • [6] PERFECTLY SECURE MESSAGE TRANSMISSION
    DOLEV, D
    DWORK, C
    WAARTS, O
    YUNG, M
    [J]. JOURNAL OF THE ACM, 1993, 40 (01) : 17 - 47
  • [7] Simple and Communication Complexity Efficient Almost Secure and Perfectly Secure Message Transmission Schemes
    Desmedt, Yvo
    Erotokritou, Stelios
    Safavi-Naini, Reihaneh
    [J]. PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2010, 2010, 6055 : 166 - +
  • [8] Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
    Kurosawa, Kaoru
    Suzuki, Kazuhiro
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (11) : 5223 - 5232
  • [9] Truly efficient 2-round perfectly secure message transmission scheme
    Kurosawa, Kaoru
    Suzuki, Kazuhiro
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2008, 2008, 4965 : 324 - +
  • [10] On the Price of Proactivizing Round-Optimal Perfectly Secret Message Transmission
    Kishore, Ravi
    Kumar, Ashutosh
    Vanarasa, Chiranjeevi
    Srinathan, Kannan
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (02) : 1404 - 1422
12345