Proposed Model for SIP Security Enhancement

.
DOI: 10.4236/cn.2010.21011   PDF   HTML     4,021 Downloads   7,764 Views   Citations

Abstract

This paper aims to examine the various methods of protecting and securing a SIP architecture and also propose a new model to enhance SIP security in certain selected, specific and confidential environments as this proposed method cannot be generalized. Several security measures and techniques have already been experimented with, proposed and implemented by several authors as SIP security is an issue of utmost impor-tance in today’s world. This paper however, aims to summarize some of the better known techniques and propose a unique method of its own. It also aims to mathematically represent SIP fitness values graphically as well via a simulation using the popular Fuzz Data Generation Algorithm. Thus this paper not only aims to contribute to the already vast field of SIP security in an effective manner but also aims to acknowledge and represent some of the fail proof methods and encryption techniques that have helped in making SIP a more secure and less wobbly network for all of us to function in.

Keywords

Share and Cite:

M. Sayyad, A. Chatterjee and S. Nalbalwar, "Proposed Model for SIP Security Enhancement," Communications and Network, Vol. 2 No. 1, 2010, pp. 69-72. doi: 10.4236/cn.2010.21011.

Conflicts of Interest

The authors declare no conflicts of interest.

References

[1] IEEE Paper: A SIP Security Testing Framework: Hemanth Srinivasan and Kamil Sarac.
[2] Applied Cryptography-Second Edition-Protocols, algorithms and Source code in C: Bruce Scheneier.
[3] SIP Tutorial: Daniel-Constantin Mierla.
[4] IEEE Paper: SIP Security Issues: The SIP Authentication Procedure and its Processing Load: Stefano Salsano, Luca Veltri, Donald Papalilo.
[5] IEEE Paper: Security Challenges for Peer-to-Peer SIP: Jan Seedorf.

  
comments powered by Disqus

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.