By Topic

Self-Authentication of Encrypted Channels in Service Network Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
David Lai ; Univ. of Southern Queensland, Toowoomba, QLD ; Zhongwei Zhang

Service network graph (SNG) was proposed as a network service sharing infrastructure to support secure services on dynamic aggregation of heterogeneous networks. To participate in SNG, a network has to share a secret key with one member of the SNG. The shared secret key will be used to set up an encrypted channel between the network and the SNG member. It is imperative to authenticate the data sent through the encrypted channel. This paper uses the symbols and approached presented by Lampson in his paper to provide a formal proof of how encryption channel authenticates itself in SNG. It forms the basis of using encrypted channels in SNG.

Published in:

Network and Parallel Computing, 2008. NPC 2008. IFIP International Conference on

Date of Conference:

18-21 Oct. 2008