Fixed-path proxy-logins with assured termination
Thomas Hardjono, Tadashi Ohta · 2002
The paper discusses the notion of path-fixing in proxy-logins and presents a method to establish secure fixed-path proxy-logins with assured termination in computer networks. The fixed-path consists of a predetermined and ordered set of nodes which participate in the proxy-login. The solution is presented within the framework of a 2-phase certification server which affords assured termination of proxy-logins in the face of the threat that participating nodes are compromised during the lifetime of the proxy-login. Each proxy-login instance is established using a unique session key which strengthens the permanent keys of each node and thus increases the difficulty of cryptanalysis attacks. This combined use of a session key with the permanent key also reduces the need to change the permanent key frequently. The approach provides a possible solution to the problem of key distribution that exists in previous approaches based on public key certification servers.>