The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
From partial consistency to global broadcast
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Byzantine Agreement Secure against General Adversaries in the Dual Failure Model
Proceedings of the 13th International Symposium on Distributed Computing
Fast consensus in networks of bounded degree
Distributed Computing
Efficient agreement using fault diagnosis
Distributed Computing
Optimally efficient multi-valued byzantine agreement
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Towards optimal and efficient perfectly secure message transmission
TCC'07 Proceedings of the 4th conference on Theory of cryptography
How many oblivious transfers are needed for secure multiparty computation?
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Efficient Byzantine agreement with faulty minority
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Error-free multi-valued consensus with byzantine failures
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Efficient multi-party computation with dispute control
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Error-free multi-valued broadcast and byzantine agreement with optimal communication complexity
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Byzantine broadcast in point-to-point networks using local linear coding
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
All-to-All gradecast using coding with byzantine failures
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Early-deciding consensus is expensive
Proceedings of the 2013 ACM symposium on Principles of distributed computing
On the complexity of broadcast setup
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |