AN EFFICIENT ALGORITHM FOR BYZANTINE AGREEMENT WITHOUT AUTHENTICATION

被引：60

作者：

DOLEV, D

FISCHER, MJ

FOWLER, R

LYNCH, NA

STRONG, HR

机构：

[1] YALE UNIV,NEW HAVEN,CT 06520

[2] UNIV WASHINGTON,SEATTLE,WA 98105

[3] MIT,CAMBRIDGE,MA 02139

来源：

INFORMATION AND CONTROL | 1982年 / 52卷 / 03期

关键词：

D O I：

10.1016/S0019-9958(82)90776-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：257 / 274

页数：18

共 9 条

[1]

Dolev D., 1981, 22nd Annual Symposium on Foundations of Computer Science, P159, DOI 10.1109/SFCS.1981.53

[2]

DOLEV D, 1982, 14TH P ACM SIGACT S

[3]

DOLEV D, 1982, J ALGORITHMS, V3

[4]

DOLEV D, 1983, UNPUB SCI IND APPL M

[5] THE BYZANTINE GENERALS PROBLEM [J].

LAMPORT, L ;

SHOSTAK, R ;

PEASE, M .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (03) :382-401

[6]

LAMPORT L, 1983, UNPUB ACM T PROGRAMM

[7]

LYNCH N, 1983, UNPUB LOWER BOUND TI

[8]

LYNCH NAD, 1982, 14TH P ACM SIGACT S

[9] REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J].

PEASE, M ;

SHOSTAK, R ;

LAMPORT, L .

JOURNAL OF THE ACM, 1980, 27 (02) :228-234

← 1 →