Benny Chor
- ABCGM.B. Awerbuctl, M. Blum, B. Chor, S. Goldwasscr, and S. Micali, "How to hnplement Bracha's O(logn) Byzantine Agreement Algorithm", unpublished manuscript, MIT.Google Scholar
- ACGS.W. Alcxi, B. Chor, O. Goldreich, and C.P. Schnorr, "RSA/Rabin Bits Are ~ + poly(log N) 1 Secure", Proc. 25tn Annual Symposture on Foundations of Computer Science (1984), pp. 449-457.Google Scholar
- Be.M. Ben-Or, "Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols", Proc. 2nu Annual A CM Symposium on Principles of Distributed Computing (1983), pp. 27-30. Google ScholarDigital Library
- Br.G. Bracha, "An O(lg n) Expected Rounds Randomized Byzantine Generals Algorithm", Proc. 17tn Annual A CM Symposium on Theory of Computing (1985), pp. 316-326. Google ScholarDigital Library
- BT.G. Bracha and S. Toueg, "Resilient Consensus Protocols", Proc. 2~u Annual A CM Symposium on Principles of Distributed Computing (1983). Google ScholarDigital Library
- CC.B. Chor and B. Coan, "A Simple and Efficient Randomized Byzantine Agreement Algn Orithm", Proc. 4ta Symposium on Reliability Distributed Software and Database Systems (1984), pp. 98-106. To appear in IEEE Transactions on Software Engineering.Google Scholar
- DS.D. Dolev and H. R. Strong, "Polynomial Algorithms for Multiple Processor Agreement", Proc. 14tn Annual A CM Symposium on Theory of Computing (1982), pp. 401-407. Google ScholarDigital Library
- FLP.M.J. Fischer, N.A. Lynch, and M.S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process", Proc. 2na ACM Symposium on Database Systems (1983), pp. 1- 7. Google ScholarDigital Library
- GM.S. Goldwasser and S. Micali, "Probabilistic Encryption", Jour. of Computer and System Sciences, 28(2) (1984), pp. 270-299.Google ScholarCross Ref
- GMR.S. Goldwasscr, S. Micali, and C. Rackoff, "The Knowledge Complexity of Interactive Proof", Proc. 17*h Annual ACM Symposium on Theory of Computing (/985), pp. 291-304. Google ScholarDigital Library
- KY.A.R. Karlin and A.C. Yao, "Probabilistic Lower Bounds for Byzantine Agreement and Clock Synchronizatir;n", unpublished manuscript, Stanford University.Google Scholar
- LSP.L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem", A CM Transactions on Programming Languages and Systems 4(3) (1982), pp. 382-401. Google ScholarDigital Library
- PSL.M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults" JACM 27(2) (1980)pp. 228-234. Google ScholarDigital Library
- Pi.S. Pinter, Distributed Computation Systems, Ph.D. thesis, Boston University, (1983).Google Scholar
- Ra.M.O. Rabin, "Randomized Byzantine Generals", Proc. 24tn Annual Symposium on Foundations of Computer Science (1983), pp. 403-4O9.Google Scholar
- Ro.E.C. Rosen, ~'Vulnerability of Network Control Protocols: An Example" A CM SIG- SOFT Software Engineering Notes, 6(1) (1981), pp. 6-8. Google ScholarDigital Library
- TC.R. Turpin and B. Coan, "Extending Binary Byzantine Agreement to Multivalucd Byzantine Agreement", Information Processing Letters 18(2)(1984), pp. 73-76.Google ScholarCross Ref
- Y1.A.C. Yao, "Theory and Applications of Trapdoor Functions", Proc. of the 23rd IEEE Symposium on Foundations of Computer Science, (1982), pp. 80-91.Google Scholar
- Y2.A.C. Yao, private communication.Google Scholar
Index Terms
- Simple constant-time consensus protocols in realistic failure models (extended abstract)
Recommendations
Simple constant-time consensus protocols in realistic failure models
Using simple protocols, it is shown how to achieve consensus in constant expected time, within a variety of fail-stop and omission failure models. Significantly, the strongest models considered are completely asynchronous. All of the results are based ...
Total acknowledgements (extended abstract): a robust feedback mechanism for end-to-end congestion control
End-to-end data transport protocols have two main functions: error recovery and congestion control. The information required by the sender to perform these functions is provided by acknowledgements (ACKs) from the receiver. The Internet transport ...
Total acknowledgements (extended abstract): a robust feedback mechanism for end-to-end congestion control
SIGMETRICS '98/PERFORMANCE '98: Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systemsEnd-to-end data transport protocols have two main functions: error recovery and congestion control. The information required by the sender to perform these functions is provided by acknowledgements (ACKs) from the receiver. The Internet transport ...
Comments