Networking 2004

The existing certificate architecture has two problems in terms of security and authentication. One is that there exists some possibility of certificate forgery by exploiting the collision problern associated with the hash algorithm used for signing. The other is that certification path complicates user authentication because it increases according to the distance between communicating users. In this paper we propose a new digital signature scheme and certificate architecture that solve the problems. It is achieved by using two-public key cryptography and a new certificate architecture. The proposed approach can be used without reconstructing the structure of the existing PKI system and always allows a certification path whose length is I regardless of the distance between the users. This is because each user confirms only the digital signature of root CA in the combined hierarchical-network infrastructure.

[1]  Michael Menth,et al.  Self-Protecting Multipaths - A Simple and Resource-Effcient Protection Switching Mechanism for MPLS Networks , 2004, NETWORKING.

[2]  Ellen W. Zegura,et al.  A quantitative comparison of graph-based models for Internet topology , 1997, TNET.

[3]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[4]  Thomas Bauschert,et al.  Multihour Design of Multi-Hop Virtual Path based Wide-Area ATM Networks , 1997 .

[5]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[6]  Balázs Gábor Józsa,et al.  On the solution of reroute sequence planning problem in MPLS networks , 2003, Comput. Networks.

[7]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[8]  Balx00E1zs Gx00E1bor Jx00F3zsa,et al.  An Efficient Algorithm for Global Path Optimization in MPLS Networks , 2001 .

[9]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..

[11]  Gero Dittmann,et al.  Network Processor Load Balancing for High-Speed Links , 2000 .

[12]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[13]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[14]  Joachim Charzinski,et al.  Towards carrier-grade next generation networks , 2003, International Conference on Communication Technology Proceedings, 2003. ICCT 2003..

[15]  Daniel O. Awduche,et al.  IP over Optical Networks: A Framework , 2004, RFC.

[16]  M.J. O'Mahony,et al.  Results from the COST 239 project. Ultra-High Capacity Optical Transmission Networks , 1996, Proceedings of European Conference on Optical Communication.

[17]  J. W. Suuballe,et al.  Disjoint Paths in a Network , 2022 .

[18]  Kireeti Kompella,et al.  Routing Extensions in Support of Generalized Multi-Protocol Label Switching (GMPLS) , 2005, RFC.

[19]  Angela Chiu,et al.  Issues for routing in the optical layer , 2001, IEEE Commun. Mag..

[20]  Deep Medhi.  Multi-hour, multi-traffic class network design for VP-based wide-area dynamically reconfigurable ATM networks , 1995, Proceedings of INFOCOM'95.