By Topic

Chinese Remainder Theorem-Based RSA-Threshold Cryptography in MANET Using Verifiable Secret Sharing Scheme

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

4 Author(s)
S. Sarkar ; E&ECE Dept., IIT Kharagpur, Kharagpur, India ; B. Kisku ; S. Misra ; M. S. Obaidat

A mobile ad hoc network (MANET) is an infrastructure-less system having no designated access points or routers and it has a dynamic topology. MANETs follow a distributed architecture, in which each node can move randomly in an area of operation. MANETs are vulnerable to various attacks. Security services in these kinds of networks are more complex than in traditional networks. In this paper, we implement a new RSA-threshold cryptography-based scheme for MANETs using verifiable secret sharing (VSS) scheme (Feldman, 1987). Threshold cryptography (TC) provides a promise of securing these networks. The proposed scheme is based on the Chinese remainder theorem (CRT) under the consideration of Asmuth-Bloom secret sharing scheme (Kaya and Selcuk, 2008). To the best of our knowledge, such a work does not exist in MANETs. The proposed scheme is efficient in terms of computational security.

Published in:

2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications

Date of Conference:

12-14 Oct. 2009