메뉴 건너뛰기




Volumn , Issue , 2007, Pages 658-668

Round complexity of authenticated broadcast with a dishonest majority

Author keywords

[No Author keywords available]

Indexed keywords

(ALGORITHMIC) COMPLEXITY; DIGITAL SIGNATURES;

EID: 46749153857     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389534     Document Type: Conference Paper
Times cited : (33)

References (33)
  • 5
    • 0043140706 scopus 로고
    • Cloture votes: N/4-resilient, polynomial-time distributed consensus in t + 1 rounds
    • P. Berman and J. A. Garay. Cloture votes: n/4-resilient, polynomial-time distributed consensus in t + 1 rounds. Mathematical Systems Theory, 26(1):3-20, 1993.
    • (1993) Mathematical Systems Theory , vol.26 , Issue.1 , pp. 3-20
    • Berman, P.1    Garay, J.A.2
  • 11
    • 0009768331 scopus 로고
    • The Byzantine generals strike again
    • D. Dolev. The Byzantine generals strike again. J. Algorithms, 3(1): 14-30, 1982.
    • (1982) J. Algorithms , vol.3 , Issue.1 , pp. 14-30
    • Dolev, D.1
  • 12
    • 0025496224 scopus 로고
    • Early stopping in Byzantine agreement
    • D. Dolev, R. Reischuk, and H. R. Strong. Early stopping in Byzantine agreement. J. ACM, 37(4):720-741, 1990.
    • (1990) J. ACM , vol.37 , Issue.4 , pp. 720-741
    • Dolev, D.1    Reischuk, R.2    Strong, H.R.3
  • 13
    • 0001683636 scopus 로고
    • Authenticated algorithms for Byzantine agreement
    • D. Dolev and H. Strong. Authenticated algorithms for Byzantine agreement. SIAM J. Computing, 12(4):656-666, 1983.
    • (1983) SIAM J. Computing , vol.12 , Issue.4 , pp. 656-666
    • Dolev, D.1    Strong, H.2
  • 14
    • 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. Computing, 26(4):873-933, 1997.
    • (1997) SIAM J. Computing , vol.26 , Issue.4 , pp. 873-933
    • Feldman, P.1    Micali, S.2
  • 15
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty processor
    • M. Fischer, N. Lynch, and M. Paterson. Impossibility of distributed consensus with one faulty processor. J. ACM, 32(2):374-382, 1985.
    • (1985) J. ACM , vol.32 , Issue.2 , pp. 374-382
    • Fischer, M.1    Lynch, N.2    Paterson, M.3
  • 16
    • 0000613943 scopus 로고
    • A lower bound for the time to assure interactive consistency
    • M. J. Fischer and N. A. Lynch. A lower bound for the time to assure interactive consistency. Info. Proc. Lett., 14(4):183-186, 1982.
    • (1982) Info. Proc. Lett , vol.14 , Issue.4 , pp. 183-186
    • Fischer, M.J.1    Lynch, N.A.2
  • 19
    • 0012525797 scopus 로고    scopus 로고
    • Fully polynomial Byzantine agreement for n > 3t processors in t+1 rounds
    • J. A. Garay and Y. Moses. Fully polynomial Byzantine agreement for n > 3t processors in t+1 rounds. SIAM J. Computing, 27(1):247-290, 1998.
    • (1998) SIAM J. Computing , vol.27 , Issue.1 , pp. 247-290
    • Garay, J.A.1    Moses, Y.2
  • 20
    • 22344432877 scopus 로고    scopus 로고
    • Secure multi-party computation without agreement
    • S. Goldwasser and Y Lindell. Secure multi-party computation without agreement. J. Cryptology, 18(3):247-287, 2005.
    • (2005) J. Cryptology , vol.18 , Issue.3 , pp. 247-287
    • Goldwasser, S.1    Lindell, Y.2
  • 26
    • 11744346186 scopus 로고
    • Coordinated traversal: (t + 1)-round Byzantine agreement in polynomial time
    • Y Moses and O. Waarts. Coordinated traversal: (t + 1)-round Byzantine agreement in polynomial time. J. Algorithms, 17(1):110-156, 1994.
    • (1994) J. Algorithms , vol.17 , Issue.1 , pp. 110-156
    • Moses, Y.1    Waarts, O.2
  • 28
    • 84941156345 scopus 로고    scopus 로고
    • A threshold pseudorandom function construction and its applications
    • J. Nielsen. A threshold pseudorandom function construction and its applications. In Advances in Cryptology-Crypto 2002.
    • Advances in Cryptology-Crypto 2002
    • Nielsen, J.1
  • 29
    • 84976810569 scopus 로고
    • Reaching agreement in the presence of faults
    • M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
    • (1980) J. ACM , vol.27 , Issue.2 , pp. 228-234
    • Pease, M.1    Shostak, R.2    Lamport, L.3
  • 30
    • 0003445668 scopus 로고    scopus 로고
    • Informationtheoretic pseudosignatures and Byzantine agreement for t ≥ n/3
    • 2882, 90830, IBM Research
    • B. Pfitzmann and M. Waidner. Informationtheoretic pseudosignatures and Byzantine agreement for t ≥ n/3. Technical Report RZ 2882 (#90830), IBM Research, 1996.
    • (1996) Technical Report RZ
    • Pfitzmann, B.1    Waidner, M.2


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