loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 IEEE International Parallel and Distributed Processing Symposium
Improving Secure Communication Policy Agreements by Building Coalitions
Long Beach, CA, USA
March 26-March 30
ISBN: 1-4244-0909-8
Srilaxmi Malladi, Georgia State University, Dept. of Computer Science, Atlanta, GA 30303 USA. cscsrmx@cs.gsu.edu
Sushil K. Prasad, Georgia State University, Dept. of Computer Science, Atlanta, GA 30303 USA. sprasad@cs.gsu.edu
Shamkant B. Navathe, Georgia Institute of Technology, College of Computing, Atlanta, GA 30332-0280 USA. sham@cc.gatech.edu
In collaborative applications, participants agree on certain level of secure communication based on communication policy specifications. Given secure communication policy specifications of various group members at design time, the minimum set of resources for a pair, called Resolved Policy Level Agreement (RPLA) is translated into appropriate security service implementations, for the pair-wise communication to take place. We propose a novel idea that the members may extend pair-wise communication quality through other trusted nodes whose communication resources offer more security. We propose a heuristic algorithm which finds the best quality of protection (QoP), a measure of the resistance to an attack, path through coalition of trusted nodes. The results from our experiments indicate a significant improvement in QoP in the range of 13% to 48% over pair-wise communications.
Citation:
Srilaxmi Malladi, Sushil K. Prasad, Shamkant B. Navathe, "Improving Secure Communication Policy Agreements by Building Coalitions," ipdps, pp.432, 2007 IEEE International Parallel and Distributed Processing Symposium, 2007
Usage of this product signifies your acceptance of the Terms of Use.