DISTRIBUTED CERTIFICATE AUTHORITY IN CLUSTER-BASED MANET USING MULTI SECRET SHARING SCHEME
1
EEDIS Laboratory, Computer Science Department, Djillali Liabes University of Sidi Bel Abbes, Algeria
Publication date: 2015-11-27
Adv. Sci. Technol. Res. J. 2015; 9(28):1-9
KEYWORDS
secret sharing schemeclusteringMobile Ad hoc Networkoverdetermined systems of linear equationsGalois fieldscertificate authority
ABSTRACT
Providing secure communications in mobile ad hoc networks (MANET) is an important and difficult problem, due to a lack of a key management infrastructure. The authentication is an important security service in (MANETs). To provide a node authentication service we use a fully distributed certificate authorities (FDCA) based on the threshold cryptography. In this paper we propose an efficient and verifiable multi secret sharing scheme in cluster-based MANET with a low computation system. Our scheme is based on the overdetermined linear system equation in Galois fields GF(2r). We have analyzed our scheme based on security and performance criteria, and compared with existing approaches. The efficiency of our proposed schemes was verified and evaluated by simulation. Simulation results show that this approach is scalable.
REFERENCES (24)
1.
Khurana S., Gupta N. and Aneja N. Minimum exposed path to the attack (MEPA) in mobile ad hoc network (MANET). In: Networking, ICN ‘07. Sixth International Conference on, 2007.
2.
Hongmei D., Mukherjee A. and Agrawal D.P. Threshold and identity-based key management and authentication for wireless ad hoc networks. In: Information Technology: Coding and Computing. Proceedings ITCC 2004. International Conference on, 2004.
3.
Dong Y. et al. Providing distributed certificate authority service in cluster-based mobile ad hoc networks. Comput. Communic., 30(11–12), 2007, 2442–2452.
4.
Lung-Chung L. and Ru-Sheng L. Securing cluster-based ad hoc networks with distributed authorities. Wireless Communications, IEEE Transactions on, 9(10), 2010, 3072–3081.
5.
Zhou L., Schneider F.B. and Renesse R.V. Coca: A secure distributed online certification authority. ACM Trans. Comput. Syst., 20(4), 2002, 329–368.
6.
Seung Y. and Robin K. Moca: Mobile certificate authority for wireless ad hoc networks. In: The second anunual PKI research workshop (PKI ‘03). Gaithersburg 2003.
7.
Wu B. et al. Secure and efficient key management in mobile ad hoc networks. Journal of Network and Computer Applications, 30(3), 2007, 937–954.
8.
Xianyong M. and Yangmin L. A verifiable dynamic threshold key management scheme based on bilinear pairing without a trusted party in mobile ad hoc network. In: Automation and Logistics (ICAL), IEEE International Conference on. 2012.
9.
Neha G. and Manish S. Securing routing protocol by distributed key management and threshold cryptography in mobile ad hoc network. International Journal of Advanced Computer Research, 3(9), 2013.
10.
Dahshan H. and Irvine J. A trust based threshold cryptography key management for mobile ad hoc networks. In: Vehicular Technology Conference Fall (VTC 2009-Fall), IEEE 70th, 2009.
12.
Blakley G.R. Safeguarding cryptographic keys. in Proceedings of the National Computer Conference. 1979.
13.
Asmuth C. and Bloom J. A modular approach to key safeguarding. IEEE Transactions on Information Theory, 29(2), 1983, 208–210.
14.
V, S.R.Y. and Bhagvati C. CRT based threshold multi secret sharing scheme. International Journal of Network Security, 16(4), 2014, 249–255.
15.
Schoenberg I.J. On Hermite-Birkhoff interpolation. Journal of Mathematical Analysis and Applications, 16(3), 1966, 538–543.
16.
Zhang Y., Liu Z. and Huang G. Sure interpolation and its application to hierarchical threshold secret sharing scheme. In: Computer Science and Computational Technology. ISCSCT ‘08. International Symposium on, 2008.
17.
Yang G. et al. (k, n) threshold secret sharing scheme based on n-dimensional cube. In: Z. Zhong (Ed.) Proceedings of the International Conference on Information Engineering and Applications (IEA 2012). Springer, London 2013, 611–618.
18.
Bai L. and Zou X. A proactive secret sharing scheme in matrix projection method. Int. J. Secur. Netw., 4(4), 2009, 201–209.
19.
Tassa T. and Villar J. On proper secrets, (t, k)-bases and linear codes. Designs, Codes and Cryptography, 52(2), 2009, 129–154.
20.
Wang S.-J., Tsai Y.-R. and Shen C.-C. Verifiable threshold scheme in multi-secret sharing distributions upon extensions of ECC. Wireless Personal Communications, 56(1), 2011, 173–182.
21.
Hu C., Liao X., and Cheng X. Verifiable multi-secret sharing based on LFSR sequences. Theor. Comput. Sci., 445, 2012, 52–62.
22.
Hung-Yu C., Jinn-Ke J.A.N. and Yuh-Min T., A practical (t, n) multi-secret sharing scheme. Communic. and Comput. Sci., 83(12), 2000, 2762–2765.
23.
Yang C.-C., Chang T.-Y. and Hwang M.-S. A (t, n) multi-secret sharing scheme. Applied Mathematics and Computation, 151(2), 2004, 483–490.
24.
Tentu A. and Rao A. Efficient verifiable multi-secret sharing based on Y.C.H scheme. In: Z. Kotulski, B. Księżopolski and K. Mazur (Eds.) Cryptography and Security Systems. Springer, Berlin–Heidelberg 2014, 100–109.
Share
RELATED ARTICLE
We process personal data collected when visiting the website. The function of obtaining information about users and their behavior is carried out by voluntarily entered information in forms and saving cookies in end devices. Data, including cookies, are used to provide services, improve the user experience and to analyze the traffic in accordance with the Privacy policy. Data are also collected and processed by Google Analytics tool (more).
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.
You can change cookies settings in your browser. Restricted use of cookies in the browser configuration may affect some functionalities of the website.
