메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 2551, Issue , 2002, Pages 93-107
Asynchronous unconditionally secure computation: An efficiency improvement
Author keywords

[No Author keywords available]
Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;
EID: 84974727234     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36231-2_9     Document Type: Conference Paper
Times cited : (10)
References (10)
  • 1
    • 84933507780 scopus 로고
    • Efficient multiparty protocols using circuit randomization
    • LNCS, Springer-Verlag
    • D. Beaver. Efficient multiparty protocols using circuit randomization. In CRYPTO’91, vol. 576 of LNCS, pp. 420-432. Springer-Verlag, 1991.
    • (1991) CRYPTO’91 , vol.576 , pp. 420-432
    • Beaver, D.1
  • 3
    • 85008184918 scopus 로고
    • Asynchronous secure computation with optimal resilience
    • M. Ben-Or, B. Kelmer, and T. Rabin. Asynchronous secure computation with optimal resilience. In 13th ACM PODC, pp. 183-192, 1994
    • (1994) 13Th ACM PODC , pp. 183-192
    • Ben-Or, M.1    Kelmer, B.2    Rabin, T.3
  • 4
    • 0027313816 scopus 로고
    • Optimal asynchronous byzantine agreement
    • R. Canetti and T. Rabin. Optimal asynchronous byzantine agreement. In 25th ACM STOC, pp. 42-51, 1993.
    • (1993) 25Th ACM STOC , pp. 42-51
    • Canetti, R.1    Rabin, T.2
  • 5
    • 0031628398 scopus 로고    scopus 로고
    • Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
    • R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In 17th ACM PODC, pp. 101-111, 1998
    • (1998) 17Th ACM PODC , pp. 101-111
    • Gennaro, R.1    Rabin, M.O.2    Rabin, T.3
  • 6
    • 84880854377 scopus 로고    scopus 로고
    • Robustness for free in unconditional multi-party computation
    • LNCS, Springer-Verlag
    • M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In CRYPTO’01, vol. 2139 of LNCS, pp. 101-118. Springer-Verlag, 2001.
    • (2001) CRYPTO’01 , vol.2139 , pp. 101-118
    • Hirt, M.1    Maurer, U.2
  • 7
    • 35248861868 scopus 로고    scopus 로고
    • Efficient multi-party computation
    • LNCS, Springer-Verlag
    • M. Hirt, U. Maurer, and B. Przydatek. Efficient multi-party computation. In ASIACRYPT 2000, vol. 1976 of LNCS, pp. 143-161. Springer-Verlag, 2000
    • (2000) ASIACRYPT 2000 , vol.1976 , pp. 143-161
    • Hirt, M.1    Maurer, U.2    Przydatek, B.3
  • 9
    • 84947784853 scopus 로고    scopus 로고
    • Efficient asynchronous secure multiparty distributed computation
    • LNCS, Springer-Verlag
    • K. Srinathan and C. Pandu Rangan. Efficient asynchronous secure multiparty distributed computation. In INDOCRYPT’00, vol. 1977 of LNCS, pp. 117-130. Springer-Verlag, 2000.
    • (2000) INDOCRYPT’00 , vol.1977 , pp. 117-130
    • Srinathan, K.1    Pandu Rangan, C.2
  • 10
    • 0020312165 scopus 로고
    • Protocols for secure computations
    • A.C. Yao. Protocols for secure computations. In 23rd IEEE FOCS, pp. 160-164, 1982.
    • (1982) 23Rd IEEE FOCS , pp. 160-164
    • Yao, A.C.1

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