Open Access Open Access  Restricted Access Subscription or Fee Access

Enhancement of Security in VoIP using Modified Shamir’s Secret Sharing and Multipath Routing

D. Saravana Kumar, N. Ananthi, A. Jasmine Antony Raj

Abstract


This paper proposes a novel security technique for VoIP which integrates the multipath routing and the secret key sharing. Existing techniques have used shamir’s secret scheme. A secret sharing scheme divides a secret into multiple shares by a dealer and shared among shareholders in such a way that any authorized subset of share- holders can reconstruct the secret; whereas any un-authorized subset of share- holders cannot recover the secret. If the maximal length of shares is equal to the length of the secret in a secret sharing scheme, the scheme is called ideal. If the shares corresponding to each un-authorized subset provide absolutely no information, in the information-theoretic sense, the scheme is called perfect. Shamir proposed the first (t; n) threshold secret sharing scheme and it s ideal and perfect. In this paper, two modifications of Shamir's secret sharing scheme are proposed. In the first modification, each shareholder keeps both x-coordinate and y-coordinate of a polynomial as private share. In the second modification, dealer uses polynomial with degree larger than the threshold value t to generate shares for a (t; n) threshold scheme. These two modifications are used to construct a hierarchical secret sharing scheme called Multilevel Threshold Secret Sharing (MTSS) is introduced for better security. The performance of the proposed approach is compared with the existing VoIPsec and VoIP with shamir’s secret sharing.

 


Keywords


VoIP, Security, Secret Sharing and Multipath Routing.

Full Text:

PDF

References


R. Barbieri, D. Bruschi, and E. Rosti, “Voice over IPsec: Analysis and Solutions”, Proc. of the 18th Annual Computer Security Applications Conference (ACSAC), pp. 261–270, 2002.

Yang, W.; Judge, P.; “VISOR: VoIP Security Using Reputation”, IEEE International Conference on Communications (ICC '08), Pp. 1489 – 1493, 2008.

Abdelnur, H.; Cridlig, V.; State, R.; Festor, O.; “VoIP security assessment: methods and tools”, 1st IEEE Workshop on VoIP Management and Security, Pp. 29 – 34, 2006.

R. Sinden, “Comparison of Voice over IP with circuit switching techniques”. Department of electronics and Computer Science, Southampton University, UK, Jan. 2002.

H. Ghodosi, J. Pieprzyk, R. Safavi-Naini, Secret sharing in multilevel and compartmented groups, in: Proc. ACISP 1998, LNCS, vol. 1438, Springer-Verlag, 1998, pp. 367{378.

W. Lou and Y. Fang, “A Multipath Routing Approach for Secure Data Delivery”, Proc. of Military Communications Conference (MILCOM), vol. 2, pp. 1467–1473, October 2001.

Ronniger, M.; Fankhauser, F.; Schanes, C.; Grechenig, T.; “A robust and flexible test environment for VoIP security tests”, 2010 International Conference for Internet Technology and Secured Transactions (ICITST), Pp. 1 – 6, 2010.

William Marshall; Alireza Farid Faryar; Kevin Kealy; Gustav de los Reyes; Israel Rosencrantz; Rachel Rosencrantz; Chaim Spielman; “Carrier VoIP Security Architecture”, 12th International Telecommunications Network Strategy and Planning Symposium (NETWORKS), Pp. 1 – 6, 2006.

Seokung Yoon; Jongil Jeong; Hyuncheol Jeong; “A study on the tightening the security of the key management protocol (RFC4568) for VoIP”, 4th International Conference on New Trends in Information Science and Service Science (NISS), Pp. 638 – 641, 2010.

S.-J. Lee and M. Gerla, Split Multipath Routing with Maximally Disjoint Paths in Ad hoc Networks, Proc. of Int. Conf. on Communications, vol. 10, pp. 3201-3205, June 2001.

E. F. Brickell, Some ideal secret sharing schemes, J. Combinatorial Mathematics and Combinatorial Computing, 6 (1989) 105-113.

D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, “Resilient Overlay Networks”, ACM Symposium on Operating Systems Principles (SOSP), pp. 131–145, October 2001.

A. C. Begen, Y. Altunbasak, and O. Ergun, Multi-Path Selection for Multiple Description Encoded Video Streaming, Int. Conf. on Communications, Anchorage, vol. 3, pp. 1583–1589, May 2003

E. F. Brickell, Some ideal secret sharing schemes, J. Combinatorial Mathematics and Combinatorial Computing, 6 (1989) 105-113.

M. Hashimoto, Y. Minami, K. Matsuo, and A. Koike, A Study on Data-Size-Reduciton Methods for Hierarchical Secret Image Sharing Method, IPSJ SIG Technical Report, vol. AVM-52, pp. 27-32, 2006.

ITU-T G.729, Coding of speech at 8 kbit/s using conjugate-structure algebraic-code-excited linear prediction (CS-ACELP), the International Telecommunication Union, March 1996.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.