메뉴 건너뛰기




Volumn 54, Issue 6, 2008, Pages 2596-2603

Resilient network coding in the presence of byzantine adversaries

Author keywords

Byzantine adversaries; Distributed network error correcting codes; Eavesdroppers; Information theoretically optimal; List decoding; Polynomial time algorithms

Indexed keywords

ALGORITHMS; CODES (STANDARDS); CODES (SYMBOLS); COMPUTER NETWORKS; DECODING; DISTRIBUTED COMPUTER SYSTEMS; EVOLUTIONARY ALGORITHMS; METROPOLITAN AREA NETWORKS; MIXING; NETWORK PROTOCOLS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROGRAMMING THEORY; SECURITY SYSTEMS; WEIGHT CONTROL;

EID: 45249101743     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.921711     Document Type: Article
Times cited : (208)

References (32)
  • 3
    • 38349083344 scopus 로고    scopus 로고
    • Network error correction, Part 2: Lower bounds
    • Jan
    • N. Cai and R. W. Yeung, "Network error correction, Part 2: Lower bounds," Commun. Inf. and Syst., vol. 6, no. 1, pp. 37-54, Jan. 2006.
    • (2006) Commun. Inf. and Syst , vol.6 , Issue.1 , pp. 37-54
    • Cai, N.1    Yeung, R.W.2
  • 5
    • 0027341860 scopus 로고
    • Perfectly secure message transmission
    • Jan
    • D. Dolev, C. Dwork, O. Waarts, and M. Yung, "Perfectly secure message transmission," J. Assoc. Comput. Mach., vol. 40, no. 1, pp. 17-47, Jan. 1993.
    • (1993) J. Assoc. Comput. Mach , vol.40 , Issue.1 , pp. 17-47
    • Dolev, D.1    Dwork, C.2    Waarts, O.3    Yung, M.4
  • 13
    • 45249094253 scopus 로고    scopus 로고
    • Resilient network coding in the presence of eavesdropping byzantine adversaries
    • Nice, France, Jun
    • S. Jaggi and M. Langberg, "Resilient network coding in the presence of eavesdropping byzantine adversaries," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 541-545.
    • (2007) Proc. IEEE Int. Symp. Information Theory , pp. 541-545
    • Jaggi, S.1    Langberg, M.2
  • 16
    • 39049116048 scopus 로고    scopus 로고
    • Network coding for joint storage and transmission with minimum cost
    • Seattle, WA, Jul
    • A. Jiang, "Network coding for joint storage and transmission with minimum cost," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1359-1363.
    • (2006) Proc. IEEE Int. Symp. Information Theory , pp. 1359-1363
    • Jiang, A.1
  • 19
    • 51649121337 scopus 로고    scopus 로고
    • Coding for errors and erasures in random network coding
    • Nice, France, June
    • R. Koetter and F. Kschischang, "Coding for errors and erasures in random network coding," in Proc. IEEE Int. Symp. Information Theory Nice, France, June 2007, pp. 791-795.
    • (2007) Proc. IEEE Int. Symp. Information Theory , pp. 791-795
    • Koetter, R.1    Kschischang, F.2
  • 21
    • 0242334165 scopus 로고    scopus 로고
    • An algebraic approach to network coding
    • Oct
    • R. Koetter and M. Médard, "An algebraic approach to network coding," IEEE/ACM Trans. Netw., vol. 11, no. 5, pp. 782-795, Oct. 2003.
    • (2003) IEEE/ACM Trans. Netw , vol.11 , Issue.5 , pp. 782-795
    • Koetter, R.1    Médard, M.2
  • 22
    • 3543050732 scopus 로고    scopus 로고
    • On-the-fly verification of rateless erasure codes for efficient content distribution
    • Oakland, CA, May
    • M. N. Krohn, M. J. Freedman, and D. Mazires, "On-the-fly verification of rateless erasure codes for efficient content distribution," in Proc. IEEE Symp. Security and Privacy, Oakland, CA, May 2004.
    • (2004) Proc. IEEE Symp. Security and Privacy
    • Krohn, M.N.1    Freedman, M.J.2    Mazires, D.3
  • 26
    • 10444286785 scopus 로고    scopus 로고
    • Broadcasting with locally bounded byzantine faults
    • Feb
    • A. Pelc and D. Peleg, "Broadcasting with locally bounded byzantine faults," Inf. Process. Lett., vol. 93, no. 3, pp. 109-115, Feb. 2005.
    • (2005) Inf. Process. Lett , vol.93 , Issue.3 , pp. 109-115
    • Pelc, A.1    Peleg, D.2
  • 27
    • 34548334202 scopus 로고    scopus 로고
    • Decentralized Security Mechanisms for Routing Protocols,
    • Ph.D. dissertation, Univ. Calif. Berkeley, Computer Science Division, Berkeley, CA
    • L. Subramanian, "Decentralized Security Mechanisms for Routing Protocols," Ph.D. dissertation, Univ. Calif. Berkeley, Computer Science Division, Berkeley, CA, 2005.
    • (2005)
    • Subramanian, L.1
  • 28
    • 0033894011 scopus 로고    scopus 로고
    • On the construction of energy-efficient broadcast and multicast trees in wireless networks
    • J. E. Wieselthier, G. D. Nguyen, and A. Ephremides, "On the construction of energy-efficient broadcast and multicast trees in wireless networks," in Proc. IEEE Infocom, 2000, vol. 2, pp. 585-594.
    • (2000) Proc. IEEE Infocom , vol.2 , pp. 585-594
    • Wieselthier, J.E.1    Nguyen, G.D.2    Ephremides, A.3
  • 29
    • 38349097767 scopus 로고    scopus 로고
    • Network error correction, part 1: Basic concepts and upper bounds
    • Jan
    • R. W. Yeung and N. Cai, "Network error correction, part 1: Basic concepts and upper bounds," Commun. Inf. and Syst., vol. 6, no. 1, pp. 19-36, Jan. 2006.
    • (2006) Commun. Inf. and Syst , vol.6 , Issue.1 , pp. 19-36
    • Yeung, R.W.1    Cai, N.2
  • 30
    • 45249115212 scopus 로고    scopus 로고
    • R. W. Yeung, S. Li, N. Cal, and Z. Zhang, Network Coding Theory. Amsterdam, The Netherlands: Now, 2006.
    • R. W. Yeung, S. Li, N. Cal, and Z. Zhang, Network Coding Theory. Amsterdam, The Netherlands: Now, 2006.
  • 31
    • 38349140937 scopus 로고    scopus 로고
    • Linear network error correction codes in packet networks
    • Jan
    • Z. Zhang, "Linear network error correction codes in packet networks," IEEE Trans. Inf. Theory, vol. 54, no. 1, pp. 209-218, Jan. 2008.
    • (2008) IEEE Trans. Inf. Theory , vol.54 , Issue.1 , pp. 209-218
    • Zhang, Z.1


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