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

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 [6]. 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 [1]1. To the best of our knowledge, such a work does not exist in MANETs. The proposed scheme is efficient in terms of computational security.

[1]  Fabrice Boudot,et al.  Efficient Proofs that a Committed Number Lies in an Interval , 2000, EUROCRYPT.

[2]  Panagiotis Papadimitratos,et al.  Secure data transmission in mobile ad hoc networks , 2003, WiSe '03.

[3]  Matthew K. Franklin,et al.  Efficient generation of shared RSA keys , 2001, JACM.

[4]  Levent Ertaul,et al.  Elliptic Curve Cryptography based Threshold Cryptography (ECC-TC) Implementation for MANETs , 2007 .

[5]  Lihua Liu,et al.  Boudot's Range-Bounded Commitment Scheme Revisited , 2007, ICICS.

[6]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[7]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[8]  Paul Feldman,et al.  A practical scheme for non-interactive verifiable secret sharing , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[9]  John Bloom,et al.  A modular approach to key safeguarding , 1983, IEEE Trans. Inf. Theory.

[10]  L. Ertaul,et al.  Security of ad hoc networks and threshold cryptography , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[11]  Pascal von Rickenbach,et al.  Wireless Ad Hoc And sensor netWorks , 2007 .

[12]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[13]  Yih-Chun Hu,et al.  A survey of secure wireless ad hoc routing , 2004, IEEE Security & Privacy Magazine.

[14]  Tatsuaki Okamoto,et al.  Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.

[15]  G. R. Blakley,et al.  Safeguarding cryptographic keys , 1899, 1979 International Workshop on Managing Requirements Knowledge (MARK).

[16]  Ali Aydin Selçuk,et al.  A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem , 2008, INDOCRYPT.

[17]  Giovanni Di Crescenzo,et al.  Improved topology assumptions for threshold cryptography in mobile ad hoc networks , 2005, SASN '05.