메뉴 건너뛰기




Volumn , Issue , 2006, Pages

Networking with secrecy constraints

Author keywords

Network security; Packet loss; Scheduling; Traffic mix

Indexed keywords

CONSTRAINT THEORY; DATA TRANSFER; NETWORK SECURITY; PACKET LOSS; ROUTING ALGORITHMS; SCHEDULING ALGORITHMS; TELECOMMUNICATION TRAFFIC;

EID: 35148832503     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MILCOM.2006.302351     Document Type: Conference Paper
Times cited : (3)

References (21)
  • 1
    • 0003516333 scopus 로고    scopus 로고
    • Intrusion detection systems: A taxonomy and survey
    • Chalmers University of Technology, Sweden, March
    • S. Axelsson, "Intrusion detection systems: A taxonomy and survey," tech. rep., Chalmers University of Technology, Sweden, March 2000.
    • (2000) tech. rep
    • Axelsson, S.1
  • 2
    • 0019532104 scopus 로고
    • Untraceable electronic mail, return addresses and digital pseudonyms
    • February
    • D. Chaum, "Untraceable electronic mail, return addresses and digital pseudonyms," Communications of the ACM, vol. 24, pp. 84-88, February 1981.
    • (1981) Communications of the ACM , vol.24 , pp. 84-88
    • Chaum, D.1
  • 4
    • 84957802536 scopus 로고    scopus 로고
    • Towards an information theoretic metric for anonymity
    • Proceedings of Privacy Enhancing Technologies Workshop PET 2002, R. Dingledine and P. Syverson, eds, Springer-Verlag, April
    • A. Serjantov and G. Danezis, "Towards an information theoretic metric for anonymity," in Proceedings of Privacy Enhancing Technologies Workshop (PET 2002) (R. Dingledine and P. Syverson, eds.), Springer-Verlag, LNCS 2482, April 2002.
    • (2002) LNCS , vol.2482
    • Serjantov, A.1    Danezis, G.2
  • 14
    • 0016562514 scopus 로고
    • The wiretap channel
    • A. Wyner, "The wiretap channel," Bell Syst. Tech. J., vol. 54, pp. 1355-1387, 1975.
    • (1975) Bell Syst. Tech. J , vol.54 , pp. 1355-1387
    • Wyner, A.1
  • 15
    • 0017973511 scopus 로고
    • Broadcast channels with confidential messages
    • May
    • I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. on Information Theory, vol. 24, pp. 339-348, May 1978.
    • (1978) IEEE Trans. on Information Theory , vol.24 , pp. 339-348
    • Csiszár, I.1    Körner, J.2
  • 16
    • 33745802064 scopus 로고    scopus 로고
    • Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds
    • Sophia Antipolis, French Riviera, France, September
    • A. Blum, D. Song, and S. Venkataraman, "Detection of Interactive Stepping Stones: Algorithms and Confidence Bounds," in Conference of Recent Advance in Intrusion Detection (RAID), (Sophia Antipolis, French Riviera, France), September 2004.
    • (2004) Conference of Recent Advance in Intrusion Detection (RAID)
    • Blum, A.1    Song, D.2    Venkataraman, S.3
  • 17
    • 35148817720 scopus 로고    scopus 로고
    • Detecting Stepping-Stone Traffic in Chaff: Fundamental Limits and Robust Algorithms
    • Tech. Rep. ACSP-TR-06-06-01, Cornell University, June
    • T. He and L. Tong, "Detecting Stepping-Stone Traffic in Chaff: Fundamental Limits and Robust Algorithms," Tech. Rep. ACSP-TR-06-06-01, Cornell University, June 2006. http://acsp.ece.cornell.edu/pubR.html.
    • (2006)
    • He, T.1    Tong, L.2
  • 18
    • 0025536530 scopus 로고
    • Pakcet Recovery in High-Speed Networks using Coding and Buffer Management
    • N. Shacham and P. McKenney, "Pakcet Recovery in High-Speed Networks using Coding and Buffer Management," in Proc. IEEE INFOCOM, pp. 124-131, 1990.
    • (1990) Proc. IEEE INFOCOM , pp. 124-131
    • Shacham, N.1    McKenney, P.2
  • 19
    • 0031122982 scopus 로고    scopus 로고
    • Effective Erasure Codes for Reliable Computer Communication Protocols
    • L. Rizzo, "Effective Erasure Codes for Reliable Computer Communication Protocols," in Proc. ACM SIGCOMM Computer Communication Review, vol. 27, pp. 24-36, 1997.
    • (1997) Proc. ACM SIGCOMM Computer Communication Review , vol.27 , pp. 24-36
    • Rizzo, L.1


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