Security for DAML web services: Annotation and matchmaking

被引:0
作者
Denker, G
Kagal, L
Finin, T
Paolucci, M
Sycara, K
机构
[1] SRI Int, Menlo Pk, CA 94025 USA
[2] Univ Maryland Baltimore Cty, Baltimore, MD 21228 USA
[3] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
来源
SEMANTIC WEB - ISWC 2003 | 2003年 / 2870卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the next generation of the Internet semantic annotations will enable software agents to extract and interpret web content more quickly than it is possible with current techniques. The focus of this paper is to develop security annotations for web services that are represented in DAML-S and used by agents. We propose several security-related ontologies that are designed to represent well-known security concepts. These ontologies are used to describe the security requirements and capabilities of web services providers and requesting agents. A reasoning engine decides whether agents and web service have comparable security characteristics. Our prototypical implementation uses the Java Theorem Prover from Stanford for deciding the degree to which the requirements and capabilities match based on our matching algorithm. The security reasoner is integrated with the Semantic Matchmaker from CMU giving it the ability to provide security brokering between agents and services.
引用
收藏
页码:335 / 350
页数:16
相关论文
共 16 条
  • [1] A CALCULUS FOR ACCESS-CONTROL IN DISTRIBUTED SYSTEMS
    ABADI, M
    BURROWS, M
    LAMPSON, B
    PLOTKIN, G
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1993, 15 (04): : 706 - 734
  • [2] ATKINSON B, 2002, WS SECUIRTY
  • [3] Bartel M, 2001, XML SIGNATURE SYNTAX
  • [4] Decentralized trust management
    Blaze, M
    Feigenbaum, J
    Lacy, J
    [J]. 1996 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 1996, : 164 - 173
  • [5] BRADSHAW J, 2003, UNPUB AAMAS 03
  • [6] *DAML OIL COMM, DAML OIL
  • [7] FIKES R, 2003, JTP SYSTEM ARCHITECT
  • [8] *IETF W3C XMLSIGN, XML SIGN
  • [9] KAGAL L, 2002, SECURITY MOBILE MULT
  • [10] KAGAL L, 2002, IEEE 4 INT WORKH POL