Message-optimal protocols for byzantine agreement (extended abstract)

Authors:
Vassos Hadzilacos;Joseph Y. Halpern
Affiliations:
Computer Systems Research Institute, University of Toronto, 10 King's College Road, Toronto, Ontario M5S 1A4 CanadaComputer Systems Research Institute University of Toronto 10 King's College Road ...;IBM Almaden Research Center, Department K53/802, 650 Harry Road, San Jose, California
Venue:
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Year:
1991

Time-optimal message-efficient work performance in the presence of faults

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Efficient Secure Multi-party Computation

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Adaptability and the Usefulness of Hints (Extended Abstract)

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Optimal time Byzantine agreement for t n/8 with linear-messages

Distributed Computing
A round and communication efficient secure ranking protocol

CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology

Hi-index	0.00