›› 2011, Vol. 26 ›› Issue (4): 711-721.doi: 10.1007/s11390-011-1170-3

• Information Security • Previous Articles     Next Articles

Improvement on the Multihop Shareholder Discovery for Threshold Secret Sharing in MANETs

Seleviawati Tarmizi, Prakash Veeraraghavan, and Somnath Ghosh   

  1. Department of Computer Science and Computer Engineering, La Trobe University, Victoria, Australia
  • Received:2010-09-17 Revised:2011-04-14 Online:2011-07-05 Published:2011-07-05

The collaboration of at least a threshold number of secret shareholders in a threshold secret sharing scheme is a strict requirement to ensure its intended functionality. Due to its promising characteristics, such a scheme has been proposed to solve a range of security problems in mobile ad hoc networks. However, discovering a sufficient number of secret shareholders in such dynamic and unpredictable networks is not easy. In this paper, we propose a more efficient shareholder discovery mechanism compared to our previous work. The discovery process is performed in a multihop fashion to adapt to the mobile ad hoc network environment. We introduce batch extension that gradually extends the shareholders' collaboration boundary by more than one hop at a time around the service requestor, to find at least the threshold number of the unknown shareholders. Through the batch extension, reply aggregation is applicable, hence reducing the redundancy use of reply routes, decreasing the required packet transmission, and lessening the service delay, compared to the previously proposed mechanism. Our simulation results show that, with the appropriate batch size, the latest mechanism is more efficient with an insignificant increase of control overhead.

[1] Syamir A. How to share secret. Communications of ACM,Nov. 1979, 22(11): 612-613.



[2] Kong J, Zerfos P, Luo H, Lu S, Zhang L. Providing robust andubiquitous security support for mobile ad-hoc networks. In Proc. ICNP,Riverside, USA, Nov.11-14, 2001, pp.251-260.



[3] Yang H, Shu J, Meng X, Lu S. SCAN: Self-organized network-layersecurity in mobile ad hoc networks. IEEE Journal on Selected Areasin Communications, Feb. 2006, 24(2): 261-273.



[4] Luo H, Kong J, Zerfos P, Lu S, Zhang L. URSA: Ubiquitous androbust access control for mobile ad hoc network. IEEE/ACMTransactions on Networking, Dec. 2004, 12(6): 1049-1063.



[5] Chen W, Lee H. Modelling threshold secret sharing schemes in adhoc networks. In Proc. International Conference on Networking,Architecture, and Storage, Chongqing, China, Jun.12-14, 2008, pp.207-214.



[6] Wang G, Wang Q, Cao J, Guo M. An effective trust establishmentscheme for authentication in mobile ad-hoc networks. In Proc. the 7th IEEEInternational Conference on Computer and Information Technology, Aizu, Japan, Oct.16-19,2007, pp.749-754.



[7] Yi S, Kravets R. Key management for heterogeneous ad hocwireless networks. In Proc. the 10th IEEE International Conference on NetworkProtocols (ICNP,2002), Paris, France, Nov.12-15, 2002, pp.202-205.



[8] Yi S, Kravets R. Moca: Mobile certificate authority for wirelessad hoc networks. In Proc. the 2nd Annual PKI Research Workshop (PKI,2003),Gaithersburg, USA, Apr.28-29, 2003.



[9] Sen J, Subramanyam H. An efficient certificate authority for adhoc networks. In Proc. the 4th Int. Conf. Distributed Computing andInternet Technology, Bhubaneswar, India, Dec.22-24, 2005, pp.97-109.



[10] Wu B, Wu J, Fernandez E B, Ilyas M, Magliveras S. Secure andefficient key management in mobile ad hoc networks. Journal ofNetwork and Computer Applications, 2007, 30(3): 937-954.



[11] Tarmizi S, Veeraraghavan P, Ghosh S. Extending thecollaboration boundary in localized threshold cryptography-basedschemes for MANETs. In Proc. 2009 IEEE 9th Malaysian InternationalConference on Communications, Kuala Lumpur, Malaysia, Dec.15-17, 2009,pp.15-17.



[12] Djenouri D, Khelladi L, Badache N. A survey of security issuesin mobile ad hoc and sensor networks. IEEE Communications Surveys& Tutorials, 2005, 7(4): 2-28.



[13] Zhou L, Haas Z J. Securing ad hoc networks. IEEE Network,Nov./Dec. 1999, 13(6): 24-30.



[14] Bettstetter C. On the minimum node degree and connectivity of awireless multihop network. In Proc. MOBIHOC,2002, Lausanne, Switzerland,Jun.9-11, 2002, pp.80-91.



[15] Jeng A A, Jan R. The r-neighbourhood graph: An adjustablestructure for topology control in wireless ad hoc networks. IEEETransaction on Parallel and Distributed Systems, Apr. 2007, 18(4): 536-549.



[16] Deng J, Han Y S, Chen P, Varshney P K. Optimal transmissionrange for wireless ad hoc networks based on energy efficiency. IEEE Transactions on Communications, Sept. 2007, 55(9): 1772-1782.



[17] Park I, Kim J, Pu I. Blocking expanding ring search algorithmfor efficient energy consumption in mobile ad hoc networks.http://hal.archives-ouvertes.fr/docs/00/05/46/87/PDF/22-Park.pdf.



[18] Al-Rodhaan M A, Mackenzie L, Ould-Khaoua M. Improvement toblocking expanding ring search for MANETs.http://www.dcs.gla.ac.uk/publications/PAPERS/8939 /B-ERS+.pdf.
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
[1] Chen Guoliang;. A Partitioning Selection Algorithm on Multiprocessors[J]. , 1988, 3(4): 241 -250 .
[2] Zhou Guodong; Ye Ganlin;. Forward-Backward Search Method[J]. , 1988, 3(4): 289 -305 .
[3] Jin Zhiquan; Liu Chengfei; Sun Zhongxiu; Zhou Xiaofang; Chen Peipei; Gu Jianming;. Design and Implementation of a Heterogeneous Distributed Database System[J]. , 1990, 5(4): 363 -373 .
[4] Hayong Zhou;. Analogical Learning and Automated Rule Constructions[J]. , 1991, 6(4): 316 -328 .
[5] Jin Guohua; Chen Fujie;. On the Problem of Optimizing Parallel Programs for Complex Memory Hierarchies[J]. , 1994, 9(1): 1 -26 .
[6] Kian-Lee Tan;. Optimization of Multi-Join Queries in Shared-Nothing Systems[J]. , 1995, 10(2): 149 -162 .
[7] Peter M. Haverty, Zhi-Ping Weng, and Ulla Hansen. Transcriptional Regulatory Networks Activated by PI3K and ERK Transduced Growth Signals in Human Glioblastoma Cells[J]. , 2005, 20(4): 439 -445 .
[8] Jian-Hui Jiang. An Error Recoverable Structure Based on Complementary Logic and Alternating- Retry[J]. , 2005, 20(6): 885 -894 .
[9] Joonghyun Ryu, Rhohun Park, and Deok-Soo Kim. Connolly Surface on an Atomic Structure via Voronoi Diagram of Atoms[J]. , 2006, 21(2): 255 -260 .
[10] Zhen-Chuan Chai, Zhen-Fu Cao, and Yuan Zhou. Efficient ID-Based Multi-Decrypter Encryption with Short Ciphertexts[J]. , 2007, 22(1): 103 -108 .

ISSN 1000-9000(Print)

         1860-4749(Online)
CN 11-2296/TP

Home
Editorial Board
Author Guidelines
Subscription
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
Tel.:86-10-62610746
E-mail: jcst@ict.ac.cn
 
  Copyright ©2015 JCST, All Rights Reserved