Kai Wang
ABSTRACT
Opportunistic networks (ONs) are widely used in many critical network applications, and security/privacy issues in ONs are critical for its wide adaption. In this paper, we propose a randomized authentication protocol which consists of node registration and authentication phases using identity-based encpryption (IBE) and trust framework. The key ideas of our authentication protocol are to generate public keys from publicly available node IDs, and not only central registration server but also the nodes with a high trust value can authenticate nodes in a network. By doing this, our protocol is of light-weight and the authentication process is randomized in a distributed way. In addition, to accommodate the disadvantage of IBE, we introduce the idea of distributed KGCs (key generation centers) and the trust framework. The protocol level security of the proposed scheme is proven by indistinguishability-based provable security analysis using random oracles, and the qualitative security analyses for various attacks are conducted.
- N Asokan, Kari Kostiainen, Philip Ginzboorg, Jörg Ott, and Cheng Luo. 2007. Applicability of identity-based cryptography for disruption-tolerant networking. In MobiSys. 52–56.Google Scholar
- Yue Bai and Jianbo Xu. 2018. Access control scheme based on fuzzy identity in opportunistic network. Procedia Comput. Sci. 131 (2018), 1122–1127.Google ScholarDigital Library
- Dan Boneh and Matt Franklin. 2001. Identity-based encryption from the Weil pairing. In CRYPTO. Springer, 213–229.Google Scholar
- Ms Priyanka Bubna and Parul Bhanarkar Jha. 1984. Comparative analysis of Identity-based encryption with traditional public key encryption in wireless network. IEEE Commun. Mag. (1984), 196–205.Google Scholar
- Craig Gentry and Alice Silverberg. 2002. Hierarchical ID-based cryptography. In ASIACRYPT. Springer, 548–566.Google Scholar
- Maggi Goyal and Manoj Chaudhary. 2013. Ensuring privacy in opportunistic network. Int. J. Comput. Appl. 76, 4 (2013), 11–17.Google Scholar
- Shohei Karaguchi, Kazuya Sakai, and Satoshi Fukumoto. 2018. Quality-Aware Task Assignment in Opportunistic Network-Based Crowdsourcing. In IPCCC. IEEE, 1–7.Google Scholar
- Dmytro Karamshuk, Chiara Boldrini, Marco Conti, and Andrea Passarella. 2011. Human mobility models for opportunistic networks. IEEE Commun. Mag. 49, 12 (2011), 157–165.Google ScholarCross Ref
- Aniket Kate, Gregory M Zaverucha, and Urs Hengartner. 2007. Anonymity and security in delay tolerant networks. In SecureComm. IEEE, 504–513.Google Scholar
- Hieu Le Xuan, Ideguchi Tetsuo, Okuda Takashi, and Tian Xuejun. 2014. A proposal of inter-vehicle (road-vehicle) authentication method using ID-based encryption and its Evaluation. In GN Workshop. 1–7.Google Scholar
- Yaozhou Ma and Abbas Jamalipour. 2010. Opportunistic node authentication in intermittently connected mobile ad hoc networks. In APCC. IEEE, 453–457.Google Scholar
- Ryota Mizuhara, Kazuya Sakai, and Satoshi Fukumoto. 2018. A collaborative-task assignment algorithm for mobile crowdsourcing in opportunistic networks. In ICC. IEEE, 1–6.Google Scholar
- Luciana Pelusi, Andrea Passarella, and Marco Conti. 2006. Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44, 11 (2006), 134–141.Google ScholarDigital Library
- Ronald L Rivest, Adi Shamir, and Leonard Adleman. 1978. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 2 (1978), 120–126.Google ScholarDigital Library
- Kazuya Sakai, Min-Te Sun, Wei-Sshinn Ku, and Ten H. Lai. 2013. Randomized Skip Lists-Based Private Authentication for Large-Scale RFID Systems. In MobiHoc. 277–280.Google Scholar
- Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, and Ten H. Lai. 2019. On The Performance Bound of Structured Key-Based RFID Authentication. (2019), 1–9.Google Scholar
- Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, and Jie Wu. 2017. A framework for anonymous routing in delay tolerant networks. In ICNP. IEEE, 1–10.Google Scholar
- Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, and Jie Wu. 2018. On anonymous routing in delay tolerant networks. IEEE Trans. Mobile Comput. 18, 12 (2018), 2926–2940.Google ScholarCross Ref
- Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, Jie Wu, and Faisal S Alanazi. 2016. An analysis of onion-based anonymous routing for delay tolerant networks. In ICDCS. IEEE, 609–618.Google Scholar
- Kazuya Sakai, Min-Te Sun, Wei-Shinn Ku, Jie Wu, and Faisal S Alanazi. 2017. Performance and security analyses of onion-based anonymous routing for delay tolerant networks. IEEE Trans. Mobile Comput. 16, 12 (2017), 3473–3487.Google ScholarCross Ref
- Adi Shamir. 1984. Identity-based cryptosystems and signature schemes. In ASIACRYPT. Springer, 47–53.Google Scholar
- Umesh Pal Singh and Naveen Chauhan. 2017. Authentication using trust framework in opportunistic networks. In ICCCNT. IEEE, 1–7.Google Scholar
- Min-Te Sun, Kazuya Sakai, Wei-Shinn Ku, Ten H. Lai, and Athanasios V. Vasilakos. 2016. Private and Secure Tag Access for Large-Scale RFID Systems. IEEE Trans. Dependable Secur. Comput. 13, 6 (2016), 657–671.Google ScholarDigital Library
- Yue Wu, Yimeng Zhao, Michel Riguidel, Guanghao Wang, and Ping Yi. 2015. Security and trust management in opportunistic networks: a survey. Secur. Commun. Netw. 8, 9 (2015), 1812–1827.Google ScholarDigital Library
Recommendations
An efficient provably-secure identity-based authentication scheme using bilinear pairings for Ad hoc network
Designing an efficient and secure authentication scheme to ensure secure communication between parties in an ad hoc network remains challenging. Recently in 2017, Shaghayegh and Mehdi proposed an identity-based authentication scheme using bilinear ...
A New Certificateless and Secure Authentication Scheme for Ad hoc Networks
Most of the authentication protocols which have been proposed so far are vulnerable to security attacks, and none of them provides non-repudiation property. Therefore, this paper aims to present a novel certificateless and secure mutual authentication ...
Leakage resilient IBE and IPE under the DLIN assumption
ACNS'13: Proceedings of the 11th international conference on Applied Cryptography and Network SecurityIn this paper, we show identity-based encryption (IBE) and inner product encryption (IPE) schemes which achieve the maximum-possible leakage rate 1−o(1). These schemes are secure under the decision linear (DLIN) assumption in the standard model. ...
Comments