메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3152, Issue , 2004, Pages 545-561
Optimal perfectly secure message transmission
Author keywords

[No Author keywords available]
Indexed keywords

MOBILE SECURITY;
EID: 35048814566     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28628-8_33     Document Type: Article
Times cited : (64)
References (15)
  • 1
    • 84898960610 scopus 로고
    • Completeness theorems for noncryptographic fault-tolerant distributed computation
    • M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. 20th ACM STOC, 1-10, 1988.
    • (1988) 20th ACM STOC , pp. 1-10
    • Ben-Or, M.1    Goldwasser, S.2    Wigderson, A.3
  • 2
    • 84888077711 scopus 로고    scopus 로고
    • Perfectly secure message transmission revisited
    • Springer-Verlag
    • Y. Desmedt and Y. Wang. Perfectly secure message transmission revisited. EUROCRYPT '02, volume 2332 of LNCS, 502-517. Springer-Verlag, 2002.
    • (2002) EUROCRYPT '02, Volume 2332 of LNCS , vol.2332 , pp. 502-517
    • Desmedt, Y.1    Wang, Y.2
  • 3
    • 0027341860 scopus 로고
    • Perfectly secure message transmission
    • January
    • D. Dolev, C. Dwork, O. Waarts, and M. Yung. Perfectly secure message transmission. JACM, 40(l):17-47, January 1993.
    • (1993) JACM , vol.40 , Issue.50 , pp. 17-47
    • Dolev, D.1    Dwork, C.2    Waarts, O.3    Yung, M.4
  • 4
    • 0000927535 scopus 로고
    • Paths, trees and flowers
    • J. Edmonds. Paths, trees and flowers. Canadian Jl. of Math., 17:449-467, 1965.
    • (1965) Canadian Jl. of Math. , vol.17 , pp. 449-467
    • Edmonds, J.1
  • 5
    • 0003640244 scopus 로고    scopus 로고
    • Secure communication in minimal connectivity models
    • M. Franklin and R.N. Wright. Secure communication in minimal connectivity models. Journal of Cryptology, 13(1):9-30, 2000.
    • (2000) Journal of Cryptology , vol.13 , Issue.1 , pp. 9-30
    • Franklin, M.1    Wright, R.N.2
  • 8
    • 0002439168 scopus 로고
    • Zur allgemeinen kurventheorie
    • K. Menger. Zur allgemeinen kurventheorie. Fundamenta Mathematicae, 10:96-115, 1927.
    • (1927) Fundamenta Mathematicae , vol.10 , pp. 96-115
    • Menger, K.1
  • 9
    • 85064850083 scopus 로고
    • An O algorithm for maximum matching in general graphs
    • S. Micali and V. Vazirani. An O algorithm for maximum matching in general graphs. 21st IEEE FOCS, 17-27, 1980.
    • (1980) 21st IEEE FOCS , pp. 17-27
    • Micali, S.1    Vazirani, V.2
  • 10
    • 85027164480 scopus 로고
    • How to withstand mobile virus attacks
    • R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. 10th ACM PODC, 51-61, 1991.
    • (1991) 10th ACM PODC , pp. 51-61
    • Ostrovsky, R.1    Yung, M.2
  • 11
    • 0024641589 scopus 로고
    • Efficient dispersal of information for security, load balancing, and fault tolerance
    • M.O. Rabin. Efficient dispersal of information for security, load balancing, and fault tolerance. JACM, 36:335-348, 1989.
    • (1989) JACM , vol.36 , pp. 335-348
    • Rabin, M.O.1
  • 12
    • 0024859552 scopus 로고
    • Verifiable secret sharing and multiparty protocols with honest majority
    • May
    • T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. 21st ACM STOC, 73-85, May 1989.
    • (1989) 21st ACM STOC , pp. 73-85
    • Rabin, T.1    Ben-Or, M.2
  • 13
    • 0012527611 scopus 로고    scopus 로고
    • Efficient perfectly secure message transmission in synchronous networks
    • H. Sayeed and H. Abu-Amara. Efficient perfectly secure message transmission in synchronous networks. Information and Computation, 126(1):53-61, 1996.
    • (1996) Information and Computation , vol.126 , Issue.1 , pp. 53-61
    • Sayeed, H.1    Abu-Amara, H.2
  • 14
    • 1142281014 scopus 로고    scopus 로고
    • Brief announcement: Efficient perfectly secure communication over synchronous networks
    • K. Srinathan, V. Vinod, and C. Pandu Rangan. Brief announcement: Efficient perfectly secure communication over synchronous networks. 22nd ACM PODC, page 252, 2003.
    • (2003) 22nd ACM PODC , pp. 252
    • Srinathan, K.1    Vinod, V.2    Pandu Rangan, C.3
  • 15
    • 0020312165 scopus 로고
    • Protocols for secure computations
    • A. C. Yao. Protocols for secure computations. 23rd IEEE FOCS, 160-164, 1982.
    • (1982) 23rd IEEE FOCS , pp. 160-164
    • Yao, A.C.1

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