메뉴 건너뛰기




Volumn 1, Issue , 2003, Pages 149-155

Secure multi-agent computations

Author keywords

Distributed computations; Multi agent systems; Security model

Indexed keywords

CODES (SYMBOLS); DATA PRIVACY; MULTI AGENT SYSTEMS; SECURITY SYSTEMS; USER INTERFACES;

EID: 1642368841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (14)
  • 5
    • 85008184918 scopus 로고
    • Asynchronous secure computations with optimal resilience
    • Michael Ben-Or, Boaz Kelmer and Tall Rabin, "Asynchronous Secure Computations with Optimal Resilience", 13th PODC, pp. 183-192, 1994.
    • (1994) 13th PODC , pp. 183-192
    • Ben-Or, M.1    Kelmer, B.2    Rabin, T.3
  • 6
    • 28144462281 scopus 로고    scopus 로고
    • Universally composable security: A new paradigm for cryptographic protocols
    • Report 2000/067
    • Ran Canetti, "Universally Composable Security: A New Paradigm for Cryptographic Protocols", Cryptology ePrint Archive, Report 2000/067.
    • Cryptology ePrint Archive
    • Canetti, R.1
  • 9
    • 84880854377 scopus 로고    scopus 로고
    • Robustness for free in unconditional multi-party computation
    • Springer-Verlag
    • Martin Hirt and Ueli Maurer, "Robustness for Free in Unconditional Multi-Party Computation", Crypto 2001, Lecture Notes in Computer Science, Vol. 2139, pp. 101-118, Springer-Verlag, 2001.
    • (2001) Crypto 2001, Lecture Notes in Computer Science , vol.2139 , pp. 101-118
    • Hirt, M.1    Maurer, U.2


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