AUTHENTICATED ALGORITHMS FOR BYZANTINE AGREEMENT

[1] NEW DIRECTIONS IN CRYPTOGRAPHY [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) : 644 - 654

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

[3] THE BYZANTINE GENERALS STRIKE AGAIN [J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 14 - 30

[4] DOLEV D, 1982, IBM RJ3587 RES REP

[5] DOLEV D, 1982, AUG P ACM SIGACT SIG

[6] A LOWER BOUND FOR THE TIME TO ASSURE INTERACTIVE CONSISTENCY [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (04) : 183 - 186

[7] LAMPORT L, 1981, USING TIME INSTEAD T

[8] LAMPORT L, UNPUB ACM T PROGRAMM

[9] REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J]. JOURNAL OF THE ACM, 1980, 27 (02) : 228 - 234

[10] RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]

[1] NEW DIRECTIONS IN CRYPTOGRAPHY [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) : 644 - 654

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

[3] THE BYZANTINE GENERALS STRIKE AGAIN [J]. JOURNAL OF ALGORITHMS, 1982, 3 (01) : 14 - 30

[4] DOLEV D, 1982, IBM RJ3587 RES REP

[5] DOLEV D, 1982, AUG P ACM SIGACT SIG

[6] A LOWER BOUND FOR THE TIME TO ASSURE INTERACTIVE CONSISTENCY [J]. INFORMATION PROCESSING LETTERS, 1982, 14 (04) : 183 - 186

[7] LAMPORT L, 1981, USING TIME INSTEAD T

[8] LAMPORT L, UNPUB ACM T PROGRAMM

[9] REACHING AGREEMENT IN THE PRESENCE OF FAULTS [J]. JOURNAL OF THE ACM, 1980, 27 (02) : 228 - 234

[10] RIVEST RL, 1978, COMMUN ACM, V21, P120, DOI [10.1145/359340.359342, 10.1145/357980.358017]