{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,16]],"date-time":"2023-11-16T00:17:49Z","timestamp":1700093869658},"reference-count":34,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2008,2,29]],"date-time":"2008-02-29T00:00:00Z","timestamp":1204243200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security Comm Networks"],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The main characteristic of a mobile <jats:italic>ad hoc<\/jats:italic> network (MANET) is its infrastructure\u2010less, highly dynamic topology, which is subject to malicious traffic analysis. Malicious intermediate nodes in MANETs are a threat concerning security as well as anonymity of exchanged information. In this paper, we propose an anonymous on\u2010demand routing protocol, called RINOMO, to protect anonymity and achieve security of nodes in MANETs. After successful authentication of the legitimate nodes in the network they can use their pseudo IDs for secure communication. Pseudo IDs of the nodes are generated considering pairing\u2010based cryptography. Nodes can generate their pseudo IDs independently and dynamically without consulting with system administrator. As a result, RINOMO reduces pseudo IDs maintenance costs. Only trust\u2010worthy nodes are allowed to take part in routing to discover a route. To ensure trustiness each node has to make authentication to its neighbors through the designed anonymous authentication process. Thus, RINOMO safely communicates between nodes without disclosing node identities. It also provides different desirable anonymous properties such as identity privacy, location privacy, route anonymity, and robustness against several attacks. Mathematical analysis of privacy loss is also evaluated and it shows there is no loss of privacy with respect to time. Thus, RINOMO is an anonymous robust protocol in MANETs. Copyright \u00a9 2008 John Wiley &amp; Sons, Ltd.<\/jats:p>","DOI":"10.1002\/sec.4","type":"journal-article","created":{"date-parts":[[2008,2,29]],"date-time":"2008-02-29T14:16:26Z","timestamp":1204294586000},"page":"179-189","source":"Crossref","is-referenced-by-count":7,"title":["Anonymous authentication and secure communication protocol for wireless mobile <i>ad hoc<\/i> networks"],"prefix":"10.1002","volume":"1","author":[{"given":"Sk. Md.","family":"Mizanur Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nidal","family":"Nasser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuo","family":"Inomata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Mambo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Okamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,2,29]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/b99485"},{"key":"e_1_2_1_3_2","volume-title":"Ad Hoc Wireless Networking","author":"Lou W","year":"2003"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/3468.935042"},{"key":"e_1_2_1_5_2","unstructured":"DARPA.Research Challenges in High Confidence Networking July1998."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1049\/PBTE040E"},{"key":"e_1_2_1_7_2","unstructured":"JiangS VaidyaN ZhaoW.Prevent traffic analysis in packet radio networks. InProceedings of DARPA Information Survivability Conference and Exposition (DISCEX II) Vol. II 2001;1153\u20131158."},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"PerkinsC Belding\u2010RoyerE DasS.Ad hoc On\u2010Demand Distance Vector (AODV) routing.RFC 3561 July2003.","DOI":"10.17487\/rfc3561"},{"key":"e_1_2_1_9_2","unstructured":"JohnsonDB MaltzDA HuY.The dynamic source routing protocol for mobile ad hoc networks (DSR). <draft\u2010ietf\u2010manet\u2010dsr\u201009.txt> April2003."},{"key":"e_1_2_1_10_2","unstructured":"DahillB LevineB RoyerE ShieldsC.A secure routing protocol for ad hoc networks.University of Massachusetts Technical Report 01\u201037 2001."},{"key":"e_1_2_1_11_2","unstructured":"ISO99 ISO IS 15408 1999. Available athttp:\/\/www.commoncriteria.org\/"},{"key":"e_1_2_1_12_2","unstructured":"ZhangY LiuW LouW.Anonymous communications in mobile ad hoc networks. InProceedings of the IEEE Infocom Conference Miami USA March 13\u201317 2005. Available athttp:\/\/ece.wpi.edu\/\u223cwjlou\/publication\/INFOCOM05_Zhang.pdf"},{"key":"e_1_2_1_13_2","unstructured":"El\u2010KhatibK KorbaL SongR YeeG.Secure dynamic distributed routing algorithm for ad hoc wireless networks. InInternational Conference on Parallel Processing Workshops (ICPPW) 2003."},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.668972"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"KongJ HongX.ANODR: anonymous on demand routing with untraceable routes for mobile ad\u2010hoc networks. InFourth ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) 2003;291\u2013302.","DOI":"10.1145\/778415.778449"},{"issue":"3","key":"e_1_2_1_16_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.3233\/JCS-2002-10302","article-title":"Hordes: a multicast based protocol for anonymity","volume":"10","author":"Levine BN","year":"2002","journal-title":"Journal of Computer Security"},{"key":"e_1_2_1_17_2","unstructured":"AhmedH AliM LuisOB.Authenticated secure communications in wireless networks. InProceeding of The 5th European Wireless Conference (EW) Barcelona Spain February2004;1\u20136."},{"key":"e_1_2_1_18_2","volume-title":"The Handbook of Ad Hoc Wireless Networks","author":"Ilyas M","year":"2003"},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398521"},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_23"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45455-1_26"},{"key":"e_1_2_1_22_2","doi-asserted-by":"crossref","unstructured":"BonehD FranklinM.Identity\u2010based encryption from the Weil pairing.Advances in Cryptology \u2013 CRYPTO Lecture Notes in Comput Sci. 2139 2001;213\u2013229.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"e_1_2_1_23_2","doi-asserted-by":"crossref","unstructured":"BonehD LynnB ShachumH.Short signatures from the Weil pairing.Advances in cryptology \u2013ASIACRYPT Lecture Notes in Comput Sci. 2248 2001 514\u2013532.","DOI":"10.1007\/3-540-45682-1_30"},{"key":"e_1_2_1_24_2","unstructured":"JouxA NguyenK.Separating decision Diffie\u2013Hellman from Diffie\u2010Hellman in Cryptographic groups.Cryptology ePrint Archive Report 2001\/03. Available athttp:\/\/eprint.iacr.org\/2001\/03\/."},{"key":"e_1_2_1_25_2","doi-asserted-by":"crossref","unstructured":"RaymondJ\u2010F.Traffic analysis: protocols attacks design issues and open problems. InProceedings of PET Vol. 2009 LNCS Springer\u2010Verlag: Berlin 2001;10\u201329.","DOI":"10.1007\/3-540-44702-4_2"},{"key":"e_1_2_1_26_2","unstructured":"HuYC PerrigA JohnsonDB.Packet leashes: a defense against wormhole attacks in wireless ad hoc networks. InProceedings of the Twenty\u2010Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) 2003."},{"key":"e_1_2_1_27_2","doi-asserted-by":"crossref","unstructured":"KoY\u2010B VaidyaN.Location\u2010Aided Routing (LAR) in mobile ad hoc networks. InProceedings of the Fourth International Conference on Mobile Computing and Networking (MobiCom) October1998;66\u201375.","DOI":"10.1145\/288235.288252"},{"key":"e_1_2_1_28_2","doi-asserted-by":"crossref","unstructured":"HuY\u2010C PerrigA JohnsonDB.Ariadne: a secure on\u2010demand routing protocol for ad hoc networks. InProceedings of the Eighth Annual International Conference on Mobile Computing and Networking (MobiCom) September2002;12\u201323.","DOI":"10.1145\/570645.570648"},{"key":"e_1_2_1_29_2","doi-asserted-by":"crossref","unstructured":"ZapataMG AsokanN.Securing ad hoc routing protocols. InProceedings of the ACM Workshop on Wireless Security (WiSe) September2002.","DOI":"10.1145\/570681.570682"},{"key":"e_1_2_1_30_2","unstructured":"SanzgiriK DahillB LevineBN ShieldsC Belding\u2010RoyerE.A secure routing protocol for ad hoc networks. InProceedings of the 10th IEEE International Conference on Network Protocols (ICNP) November2002."},{"key":"e_1_2_1_31_2","unstructured":"PapadimitratosP HaasZJ.Secure routing for mobile ad hoc networks. InSCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS) January2002."},{"key":"e_1_2_1_32_2","unstructured":"ANSI\/IEEE.802.11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications 2003."},{"key":"e_1_2_1_33_2","doi-asserted-by":"crossref","unstructured":"PfitzmannA KoehntoppM.Anonymity Unobservability and Pseudonymity\u2014A Proposal for Terminology.http:\/\/www.koehntopp.de\/marit\/publikationen\/.2000.","DOI":"10.1007\/3-540-44702-4_1"},{"key":"e_1_2_1_34_2","unstructured":"DiazC SeysS ClaessensJ PreneelB.Towards measuring anonymity.Proceedings of Privacy Enhancing Technologies Workshop (PET) April 14\u201315 2002. Federath H (ed.). Designing privacy enhancing technologies.Lecture Notes in Computer Science (LNCS 2482). Springer\u2010Verlag: Berlin 2002. Retrieved on 2005."},{"key":"e_1_2_1_35_2","unstructured":"SerjantovA DanezisG.Towards an information theoretic metric for anonymity.Proceedings of Privacy Enhancing Technologies Workshop (PET) April 14\u201315 2002. Federath H (ed.). Designing privacy enhancing technologies.Lecture Notes in Computer Science (LNCS 2482) Springer\u2010Verlag: Berlin 2002. Retrieved on 2005."}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fsec.4","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/sec.4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T16:20:32Z","timestamp":1700065232000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/sec.4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,29]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1002\/sec.4"],"URL":"https:\/\/doi.org\/10.1002\/sec.4","archive":["Portico"],"relation":{},"ISSN":["1939-0114","1939-0122"],"issn-type":[{"value":"1939-0114","type":"print"},{"value":"1939-0122","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,29]]}}}