PERFECTLY SECURE MESSAGE TRANSMISSION

被引：242
|
作者：
DOLEV, D
DWORK, C
WAARTS, O
YUNG, M
机构：
[1] STANFORD UNIV,STANFORD,CA 94305
[2] IBM CORP,THOMAS J WATSON RES CTR,YORKTOWN HTS,NY 10598
来源：
JOURNAL OF THE ACM | 1993年 / 40卷 / 01期
关键词：
ALGORITHMS; RELIABILITY; SECURITY; DISTRIBUTED COMPUTING; FAULT-TOLERANCE; PERFECTLY SECURE COMMUNICATION;
D O I：
10.1145/138027.138036
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper studies the problem of perfectly secure communication in general network in which processors and communication lines may be faulty. Lower bounds are obtained on the connectivity required for successful secure communication. Efficient algorithms are obtained that operate with this connectivity and rely on no complexity-theoretic assumptions. These are the first algorithms for secure communication in a general network to simultaneously achieve the three goals of perfect secrecy, perfect resiliency, and worst-case time linear in the diameter of the network.
引用
收藏
页码：17 / 47
页数：31
相关论文
共 50 条
  • [1] Perfectly secure message transmission revisited
    Wang, Yongge
    Desmedt, Yvo
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2582 - 2595
  • [2] On Proactive perfectly secure message transmission
    Srinathan, Karman
    Raghavendra, Prasad
    Chandrasekaran, Pandu Rangan
    [J]. INFORMATION SECURITY AND PRIVACY, PROCEEDINGS, 2007, 4586 : 461 - +
  • [3] Perfectly secure message transmission revisited
    Desmedt, Y
    Wang, Y
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2002, PROCEEDINGS, 2002, 2332 : 502 - 517
  • [4] Optimal perfectly secure message transmission
    Srinathan, K
    Narayanan, A
    Rangan, CP
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 545 - 561
  • [5] Perfectly Secure Message Transmission in Two Rounds
    Spini, Gabriele
    Zemor, Gilles
    [J]. THEORY OF CRYPTOGRAPHY, TCC 2016-B, PT I, 2016, 9985 : 286 - 304
  • [6] Efficient perfectly secure message transmission in synchronous networks
    Sayeed, HM
    AbuAmara, H
    [J]. INFORMATION AND COMPUTATION, 1996, 126 (01) : 53 - 61
  • [7] 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 - +
  • [8] Perfectly Secure Message Transmission Against Rational Adversaries
    Fujita, Maiki
    Koshiba, Takeshi
    Yasunaga, Kenji
    [J]. IEEE Journal on Selected Areas in Information Theory, 2022, 3 (02): : 390 - 404
  • [9] Network-Agnostic Perfectly Secure Message Transmission Revisited
    Bhimrajka, Nidhish
    Choudhury, Ashish
    Varadarajan, Supreeth
    [J]. PROGRESS IN CRYPTOLOGY - INDOCRYPT 2023, PT II, 2024, 14460 : 25 - 44
  • [10] Efficient Protocols for Perfectly Secure Message Transmission With Applications to Secure Network Coding
    Spini, Gabriele
    Zemor, Gilles
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (10) : 6340 - 6353
12345