메뉴 건너뛰기




Volumn , Issue , 2007, Pages 33-47

On the safety and efficiency of firewall policy deployment

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; OPTIMIZATION; SECURITY OF DATA; THEOREM PROVING;

EID: 34548792398     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2007.32     Document Type: Conference Paper
Times cited : (42)

References (38)
  • 2
    • 34548746142 scopus 로고    scopus 로고
    • Cisco Firewall Service Module
    • Cisco Firewall Service Module. http://www.cisco.com/en/US/products/hw/ modules/ps2706/ps4452/index.html.
  • 3
    • 84865940315 scopus 로고    scopus 로고
    • Cisco PIX Firewall. http://www.cisco.com/en/US/products/hw/vpndevc/ ps2030.
    • Cisco PIX Firewall
  • 4
    • 34548743799 scopus 로고    scopus 로고
    • Cisco Security Manager, http://www.cisco.com/en/US/products/ps6498/index. html.
    • Cisco Security Manager
  • 6
    • 34548715030 scopus 로고    scopus 로고
    • Iptables Howto. http://www.netfilter.org/documentation/H0WT0/packet- filtering-H0WT0-7.html.
    • Iptables Howto
  • 9
    • 34548759992 scopus 로고    scopus 로고
    • Nokia IPSO. http://europe.nokia.com/A4153092.
    • Nokia IPSO
  • 10
    • 51149097322 scopus 로고    scopus 로고
    • ServGate EdgeForce. http://www.servgate.com/pdf/infosec_article.pdf.
    • ServGate EdgeForce
  • 12
    • 0001276534 scopus 로고
    • An algorithm for the organization of information
    • G. M. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. Soviet Math. Doclady, 3:1259-1263, 1962.
    • (1962) Soviet Math. Doclady , vol.3 , pp. 1259-1263
    • Adelson-Velskii, G.M.1    Landis, E.M.2
  • 13
    • 0033885347 scopus 로고    scopus 로고
    • Detecting and resolving packet filter conflicts
    • H. Adiseshu, S. Suri, and G. M. Parulkar. Detecting and resolving packet filter conflicts. In INFOCOM, pages 1203-1212, 2000.
    • (2000) INFOCOM , pp. 1203-1212
    • Adiseshu, H.1    Suri, S.2    Parulkar, G.M.3
  • 14
    • 84904310464 scopus 로고    scopus 로고
    • Firewall policy advisor for anomaly discovery and rule editing
    • E. S. Al-Shaer and H. H. Hamed. Firewall policy advisor for anomaly discovery and rule editing. In Integrated Network Management, pages 17-30, 2003.
    • (2003) Integrated Network Management , pp. 17-30
    • Al-Shaer, E.S.1    Hamed, H.H.2
  • 18
    • 34548803331 scopus 로고    scopus 로고
    • Securing systems with host-based firewalls
    • September
    • M. Englund. Securing systems with host-based firewalls. Sun BluePrints OnLine, September 2001.
    • (2001) Sun BluePrints OnLine
    • Englund, M.1
  • 19
    • 26644472329 scopus 로고    scopus 로고
    • Secure socket layer 3.0, IETF draft
    • November
    • A. O. Freier, P. Karlton, and P. C. Kocher. Secure socket layer 3.0, IETF draft, November 1996.
    • (1996)
    • Freier, A.O.1    Karlton, P.2    Kocher, P.C.3
  • 20
    • 84944041936 scopus 로고    scopus 로고
    • Z. Fu, S. F. Wu, H. Huang, K. Loh, F. Gong, I. Baldine, and C. Xu. IPSec/VPN security policy: Correctness, conflict detection, and resolution. In POLICY Workshop, pages 39-56, 2001.
    • Z. Fu, S. F. Wu, H. Huang, K. Loh, F. Gong, I. Baldine, and C. Xu. IPSec/VPN security policy: Correctness, conflict detection, and resolution. In POLICY Workshop, pages 39-56, 2001.
  • 23
    • 84976825385 scopus 로고
    • Algorithms for the longest common subsequence problem
    • D. S. Hirschberg. Algorithms for the longest common subsequence problem. J. ACM, 24(4):664-675, 1977.
    • (1977) J. ACM , vol.24 , Issue.4 , pp. 664-675
    • Hirschberg, D.S.1
  • 24
    • 0017492836 scopus 로고
    • A fast algorithm for computing longest common subsequences
    • J. W. Hunt and T. G. Szymanski. A fast algorithm for computing longest common subsequences. Commun. ACM, 20(5):350-353, 1977.
    • (1977) Commun. ACM , vol.20 , Issue.5 , pp. 350-353
    • Hunt, J.W.1    Szymanski, T.G.2
  • 27
    • 0018985316 scopus 로고
    • A faster algorithm computing string edit distances
    • W. J. Masek and M. Paterson. A faster algorithm computing string edit distances. J. Comput. Syst. Sci., 20(1):18-31, 1980.
    • (1980) J. Comput. Syst. Sci , vol.20 , Issue.1 , pp. 18-31
    • Masek, W.J.1    Paterson, M.2
  • 28
    • 34548730033 scopus 로고    scopus 로고
    • D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. The spread of the Sapphire/Slammer worm. Technical report, CAIDA, ICSI, Silicon Defense, UC Berkeley EECS and UC San Diego CSE, 2003.
    • D. Moore, V. Paxson, S. Savage, C. Shannon, S. Staniford, and N. Weaver. The spread of the Sapphire/Slammer worm. Technical report, CAIDA, ICSI, Silicon Defense, UC Berkeley EECS and UC San Diego CSE, 2003.
  • 29
    • 0023012946 scopus 로고
    • (nd) difference algorithm and its variations
    • E. W. Myers. An O(nd) difference algorithm and its variations. Algorithmica, 1(2):251-266, 1986.
    • (1986) Algorithmica , vol.1 , Issue.2 , pp. 251-266
    • Myers, E.W.1    An, O.2
  • 30
    • 0020205756 scopus 로고
    • A longest common subsequence algorithm suitable for similar text strings
    • N. Nakatsu, Y. Kambayashi, and S. Yajima. A longest common subsequence algorithm suitable for similar text strings. Acta Inf., 18:171-179, 1982.
    • (1982) Acta Inf , vol.18 , pp. 171-179
    • Nakatsu, N.1    Kambayashi, Y.2    Yajima, S.3
  • 34
    • 84976791819 scopus 로고
    • Bounds on the complexity of the longest common subsequence problem
    • J. D. Ullman, A. V. Aho, and D. S. Hirschberg. Bounds on the complexity of the longest common subsequence problem. J. ACM, 23(1): 1-12, 1976.
    • (1976) J. ACM , vol.23 , Issue.1 , pp. 1-12
    • Ullman, J.D.1    Aho, A.V.2    Hirschberg, D.S.3
  • 35
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. ACM, 21(1):168-173, 1974.
    • (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2
  • 36
    • 3042617182 scopus 로고    scopus 로고
    • A quantitative study of firewall configuration errors
    • A. Wool. A quantitative study of firewall configuration errors. IEEE Computer, 37(6):62-67, 2004.
    • (2004) IEEE Computer , vol.37 , Issue.6 , pp. 62-67
    • Wool, A.1


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