메뉴 건너뛰기




Volumn , Issue , 2008, Pages 405-414

An almost-surely terminating polynomial protocol for asynchronous Byzantine agreement with optimal resilience

Author keywords

Byzantine agreement; Distributed computing; Secret sharing

Indexed keywords

POLYNOMIALS;

EID: 57549095453     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400804     Document Type: Conference Paper
Times cited : (70)

References (14)
  • 1
    • 0020976844 scopus 로고
    • Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols
    • M. Ben-Or. Another advantage of free choice (extended abstract): Completely asynchronous agreement protocols. In Proc. 2nd ACM Symposium on Principles of Distributed Computing, pages 27-30, 1983.
    • (1983) Proc. 2nd ACM Symposium on Principles of Distributed Computing , pp. 27-30
    • Ben-Or, M.1
  • 4
    • 0027313816 scopus 로고
    • Fast asynchronous Byzantine agreement with optimal resilience
    • R. Canetti and T. Rabin. Fast asynchronous Byzantine agreement with optimal resilience. In Proc. 25th ACM Symp. Theory of Computing, pages 42-51, 1993.
    • (1993) Proc. 25th ACM Symp. Theory of Computing , pp. 42-51
    • Canetti, R.1    Rabin, T.2
  • 7
    • 0030197368 scopus 로고    scopus 로고
    • The weakest failure detector for solving consensus
    • T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43:685-722, 1996.
    • (1996) Journal of the ACM , vol.43 , pp. 685-722
    • Chandra, T.D.1    Hadzilacos, V.2    Toueg, S.3
  • 8
    • 0009768331 scopus 로고
    • The Byzantine generals strike again
    • D. Dolev. The Byzantine generals strike again. Journal of Algorithms, 3:14-30, 1982.
    • (1982) Journal of Algorithms , vol.3 , pp. 14-30
    • Dolev, D.1
  • 10
    • 0031210863 scopus 로고    scopus 로고
    • An optimal probabilistic protocol for synchronous Byzantine agreement
    • P. Feldman and S. Micali. An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput., 26(4):873-933, 1997.
    • (1997) SIAM J. Comput , vol.26 , Issue.4 , pp. 873-933
    • Feldman, P.1    Micali, S.2
  • 11
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty processor
    • M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty processor. Journal of the ACM, 32(2):374-382, 1985.
    • (1985) Journal of the ACM , vol.32 , Issue.2 , pp. 374-382
    • Fischer, M.J.1    Lynch, N.A.2    Paterson, M.S.3
  • 12
    • 33749542544 scopus 로고    scopus 로고
    • On expected constant-round protocols for Byzantine agreement
    • Cynthia Dwork, editor, CRYPTO, of, Springer
    • J. Katz and C.-Y. Koo. On expected constant-round protocols for Byzantine agreement. In Cynthia Dwork, editor, CRYPTO, volume 4117 of Lecture Notes in Computer Science, pages 445-462. Springer, 2006.
    • (2006) Lecture Notes in Computer Science , vol.4117 , pp. 445-462
    • Katz, J.1    Koo, C.-Y.2
  • 13
    • 84976810569 scopus 로고
    • Reaching agreement in the presence of faults
    • M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. of the ACM, 27(2):228-234, 1980.
    • (1980) J. of the ACM , vol.27 , Issue.2 , pp. 228-234
    • Pease, M.1    Shostak, R.2    Lamport, L.3
  • 14
    • 0024859552 scopus 로고
    • Verifiable secret sharing and multiparty protocols with honest majority
    • T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. 21st ACM Symp. Theory of Computing, pages 73-85, 1989.
    • (1989) Proc. 21st ACM Symp. Theory of Computing , pp. 73-85
    • Rabin, T.1    Ben-Or, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.