Trust-based secure information sharing between federal government agencies

被引:30
作者
Liu, P
Chetal, A
机构
[1] Penn State Univ, Sch Informat Sci & Technol, University Pk, PA 16802 USA
[2] Penn State Univ, Dept Comp Sci & Engn, Pond Lab 220, University Pk, PA 16802 USA
来源
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY | 2005年 / 56卷 / 03期
关键词
D O I
10.1002/asi.20117
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The September 11 attack and the following investigations show that there is a serious information sharing problem among the relevant federal government agencies, and the problem can cause substantial deficiencies in terrorism attack detection. In this paper we provide a systematic analysis of the causes of this problem; and conclude that existing secure information sharing technologies and protocols cannot provide enough incentives for government agencies to share information with each other without worrying that their own interests can be jeopardized. Although trust-based information access is well studied in the literature, the existing trust models, which are based on certified attributes, cannot support effective information sharing among government agencies, which requires an interest-based trust model. To solve this information sharing problem, we propose an innovative interest-based trust model and a novel information sharing protocol, where a family of information sharing policies are integrated, and information exchange and trust negotiation are interleaved with and interdependent upon each other. In addition, an implementation of this protocol is presented using the emerging technology of XML Web Services. The implementation is totally compatible with the Federal Enterprise Architecture reference models and can be directly integrated into existing E-Government systems.
引用
收藏
页码:283 / 298
页数:16
相关论文
共 50 条
[1]  
AHN G, 2001, P ACM S ACC CONTR MO, P153
[2]  
Ajmani S., 2001, MITLCSTR847
[3]  
AKELLA Y, 2000, DARPA INF SURV C EXP
[4]  
[Anonymous], 1999, KEYNOTE TRUST MANAGE
[5]  
[Anonymous], 1997, ACM CCS
[6]  
[Anonymous], P 2003 ACM SIGMOD IN, DOI DOI 10.1145/872757.872771
[7]  
APRIL CA, 2002, MONUMENTAL MISSION I
[8]   Asynchronous protocols for optimistic fair exchange [J].
Asokan, N ;
Shoup, V ;
Waidner, M .
1998 IEEE SYMPOSIUM ON SECURITY AND PRIVACY - PROCEEDINGS, 1998, :86-99
[9]  
BAO F, 1998, P IEEE S RES SEC PRI, P86
[10]   A FAIR PROTOCOL FOR SIGNING CONTRACTS [J].
BENOR, M ;
GOLDREICH, O ;
MICALI, S ;
RIVEST, RL .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1990, 36 (01) :40-46