{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T15:20:55Z","timestamp":1781104855770,"version":"3.54.1"},"reference-count":46,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7,1]]},"abstract":"<p>The recent rise and widespread adoption of wireless networked embedded systems for mobile communication applications has sparked numerous visions of an ever more networked and interactive world. One such vision proposed in the past years are wireless ad hoc social networks, where wireless ad hoc communication and mobile devices are combined with integrated social characteristics to exchange data related games, rumors, and interesting information. However, they are still faces many challenges including routing security and privacy preservation. In this paper, the authors propose an Efficient Conditional Privacy preservation scheme with Demand Response, called ECPDR, for implement an effective information security, and achieving privacy preservation of message transmitted over wireless ad hoc social networks. They choose Ad hoc On demand Distance Vector (AODV) as a reactive routing protocol. This routing protocol has been extended to include the necessary parameters to perform the cryptographic operations at the nodes. Based on the cooperative neighbor and the short signatures technique, the proposed ECPDR scheme can not only detect and avoid but also can preserves the message privacy against elemental attacks and compound attacks. Extensive analyses and experiments are given to demonstrate its high detection rate and practicability under various scenarios.<\/p>","DOI":"10.4018\/ijertcs.2013070103","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T13:50:33Z","timestamp":1387201833000},"page":"43-71","source":"Crossref","is-referenced-by-count":6,"title":["ECPDR"],"prefix":"10.4018","volume":"4","author":[{"given":"Mohamed Amine","family":"Ferrag","sequence":"first","affiliation":[{"name":"Department of Computer Science, Networks and Systems Laboratory (LRS), Badji Mokhtar-Annaba University, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mehdi","family":"Nafa","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Networks and Systems Laboratory (LRS), Badji Mokhtar-Annaba University, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salim","family":"Ghanemi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Embedded Systems Laboratory (LASE), Badji Mokhtar-Annaba University, Algeria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"ijertcs.2013070103-0","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.904002"},{"key":"ijertcs.2013070103-1","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., David, H., Cristina, N., & Herbert, R. (2002). An on-demand secure routing protocol resilient to byzantine failures. Proceedings of the 1st ACM workshop on Wireless security (pp. 21-30). Atlanta, USA: ACM New York.","DOI":"10.1145\/570681.570684"},{"key":"ijertcs.2013070103-2","doi-asserted-by":"crossref","unstructured":"Azarderakhsh, R., Longa, P., Hu, S., & Jao, D. (2013). Efficient implementation of bilinear pairings on ARM processors. Springer Selected Areas in Cryptography, 149-165.","DOI":"10.1007\/978-3-642-35999-6_11"},{"key":"ijertcs.2013070103-3","doi-asserted-by":"publisher","DOI":"10.1109\/TEM.2006.883706"},{"key":"ijertcs.2013070103-4","doi-asserted-by":"crossref","unstructured":"Bender, A., Adam, B., Neil, S., Bobby, B., & Daniel, S. (2009). Persona: an online social network with user-defined privacy. Proceedings of the ACM SIGCOMM 2009 conference on Data communication (pp. 135-146). Barcelona, Spain: ACM New York.","DOI":"10.1145\/1594977.1592585"},{"key":"ijertcs.2013070103-5","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-007-9005-7"},{"key":"ijertcs.2013070103-6","doi-asserted-by":"crossref","unstructured":"Brzuska, C., Fischlin, M., Freudenreich, T., Lehmann, A., Page, M., Schelbert, J., et al. (2009). Security of sanitizable signatures revisited. Proceeding of the 12th International Conference on Practice and Theory in Public Key Cryptography (pp. 317-336). California: Springer-Verlag Berlin.","DOI":"10.1007\/978-3-642-00468-1_18"},{"key":"ijertcs.2013070103-7","doi-asserted-by":"crossref","unstructured":"Calandriello, G., Papadimitratos, P., Hubaux, J. P., & Lioy, A. (2007). Efficient and robust pseudonymous authentication in VANET. Proceeding of 4th ACM International Workshop VANET (pp. 19\u201328). Montr\u00e9al, QC, Canada: ACM New York.","DOI":"10.1145\/1287748.1287752"},{"key":"ijertcs.2013070103-8","author":"T.Clausen","year":"2003","journal-title":"Optimized link state routing protocol. RFC 3626"},{"key":"ijertcs.2013070103-9","author":"J.Deng","year":"2003","journal-title":"Enhancing base station security in wireless sensor networks. CU-CS-951-03: University of Colorado"},{"key":"ijertcs.2013070103-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2005.12.003"},{"key":"ijertcs.2013070103-11","author":"G.Donald","year":"2008","journal-title":"Fundamentals of queueing theory"},{"issue":"2","key":"ijertcs.2013070103-12","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.14778\/1687553.1687611","article-title":"Enabling social networking in ad hoc networks of mobile phones.","volume":"2","author":"S.Emre","year":"2009","journal-title":"Proceedings of the VLDB Endowment"},{"key":"ijertcs.2013070103-13","author":"M. A.Ferrag","year":"2012","journal-title":"Study of attacks in ad hoc networks"},{"key":"ijertcs.2013070103-14","unstructured":"Ferrag, M. A., Nafa, M., & Ghanemi, S. (2012). OlsrBOOK: a privacy-preserving mobile social network leveraging on securing the olsr routing protocol. Proceeding of The 8 th International Scientific Conference eLearning and Software for Education (pp. 133-139). Bucharest, Romania: Editura Universitara."},{"key":"ijertcs.2013070103-15","unstructured":"Ferrag, M. A., Nafa, M., & Ghanemi, S. (2013). A new security mechanism for ad-hoc on-demand distance vector in mobile ad hoc social networks. Proceedings of the 7th Workshop on Wireless and Mobile Ad-Hoc Networks (WMAN 2013) in Conjunction with the Conference on Networked Systems NetSys\/KIVS. Stuttgart, Germany: WMAN."},{"key":"ijertcs.2013070103-16","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-4666-4691-9.ch010"},{"key":"ijertcs.2013070103-17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks: conceptual clarification.","volume":"1","author":"L. C.Freeman","year":"1978","journal-title":"Elsevier Social Networks"},{"key":"ijertcs.2013070103-18","doi-asserted-by":"crossref","unstructured":"Guha, S., Tang, K., & Francis, P. (2008). NOYB: privacy in online social networks. Proceedings of the first workshop on Online social networks (pp. 49\u201354). Seattle, WA, USA: ACM New York.","DOI":"10.1145\/1397735.1397747"},{"key":"ijertcs.2013070103-19","unstructured":"IETF MANET group. (n.d.). Retrieved June 01, 2013, from http:\/\/datatracker.ietf.org\/wg\/manet\/"},{"key":"ijertcs.2013070103-20","unstructured":"Information Sciences Institute. (2008). Retrieved June 01, 2013, from http:\/\/www.isi.edu\/nsnam\/ns\/"},{"key":"ijertcs.2013070103-21","doi-asserted-by":"crossref","unstructured":"Jian, Y., Shigang, C., Zhan, Z., & Liang, Z. (2007). Protecting receiver-location privacy in wireless sensor networks. Proceedings of 26th IEEE International Conference on Computer Communications (pp. 1955-1963). Anchorage, Alaska, USA: IEEE Computer Society.","DOI":"10.1109\/INFCOM.2007.227"},{"key":"ijertcs.2013070103-22","doi-asserted-by":"crossref","unstructured":"Kamatchi, V., Rajeswari, M., & Raja, K. (2013). Securing data from black hole attack using aodv routing for mobile ad hoc networks. Proceedings of the Second International Conference on Advances in Computing and Information Technology (pp. 365-373). Chennai, India: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-31552-7_38"},{"key":"ijertcs.2013070103-23","doi-asserted-by":"crossref","unstructured":"Lee, J., & Hong, C. S. (2011). A mechanism for building Ad-hoc social network based on users interest. Proceedings of the 13th Asia-pacific Network Operatens and Management Symposium (pp. 1-4). Taipei, Taiwan: IEEE Computer Society.","DOI":"10.1109\/APNOMS.2011.6076997"},{"key":"ijertcs.2013070103-24","doi-asserted-by":"crossref","unstructured":"Li, H., Bok, K., & Yoo, J. (2013). Mobile P2P social network using location and profile. In Ubiquitous Information Technologies and Applications (Vol. 214, pp. 333-339). Springer Netherlands.","DOI":"10.1007\/978-94-007-5857-5_36"},{"key":"ijertcs.2013070103-25","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2012.2202932"},{"key":"ijertcs.2013070103-26","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2009.090502"},{"key":"ijertcs.2013070103-27","author":"R.Lu","year":"2012","journal-title":"Security and privacy preservation in vehicular social networks"},{"key":"ijertcs.2013070103-28","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.86"},{"key":"ijertcs.2013070103-29","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2011.2164068"},{"key":"ijertcs.2013070103-30","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.95"},{"key":"ijertcs.2013070103-31","author":"W.Mao","year":"2003","journal-title":"Modern Cryptography: Theory and Practice"},{"key":"ijertcs.2013070103-32","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2008.4481351"},{"issue":"2","key":"ijertcs.2013070103-33","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.socnet.2010.03.006","article-title":"Node centrality in weighted networks: Generalizing degree and shortest path.","volume":"32","author":"T.Opsahl","year":"2010","journal-title":"Elsevier Social Networks"},{"key":"ijertcs.2013070103-34","doi-asserted-by":"crossref","unstructured":"Ozturk, C., & Zhang, Y. (2004). Source-location privacy in energy-constrained sensor network routing. Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks (pp. 88-93). Washington, USA: ACM New York.","DOI":"10.1145\/1029102.1029117"},{"key":"ijertcs.2013070103-35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9405-9"},{"key":"ijertcs.2013070103-36","doi-asserted-by":"crossref","unstructured":"Perkins, C., Belding-Royer, E., & Das, S. (2003). Ad hoc On-Demand Distance Vector Routing. Retrieved June 01, 2013, from http:\/\/tools.ietf.org\/html\/rfc3561","DOI":"10.17487\/rfc3561"},{"key":"ijertcs.2013070103-37","doi-asserted-by":"crossref","unstructured":"Sanguankotchakorn, T., Shrestha, S., & Sugino, N. (2012). Effective Ad Hoc Social Networking on OLSR MANET Using Similarity of Interest Approach. Proceedings of 5th International Conference IDCS, (pp. 15-28). Wuyishan, Fujian, China: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-34883-9_2"},{"key":"ijertcs.2013070103-38","unstructured":"Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., & Belding-Royer, E. M. (2002). A secure routing protocol for ad hoc networks. Proceedings of 10th IEEE International Conference on Network Protocols (pp. 78-87). Paris, France: IEEE Computer Society."},{"key":"ijertcs.2013070103-39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"ijertcs.2013070103-40","doi-asserted-by":"crossref","unstructured":"Scott, M. (2011). On efficient implementation of pairing-based protocols. Proceedings of 13th IMA International Conference IMACC (pp. 296-308). Oxford, UK: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-25516-8_18"},{"key":"ijertcs.2013070103-41","doi-asserted-by":"crossref","unstructured":"Shirey, R. (2007). Internet security glossary. Retrieved June 01, 2013, from http:\/\/tools.ietf.org\/html\/rfc4949","DOI":"10.17487\/rfc4949"},{"key":"ijertcs.2013070103-42","doi-asserted-by":"crossref","unstructured":"Toshiyuki, I., Nguyen, M., & Tanaka, K. (2013). Proxy re-encryption in a stronger security model extended from CT-RSA2012. Proceedings of The Cryptographers\u2019 Track at the RSA Conference (pp. 277-292). San Francisco,CA, USA: Springer Berlin Heidelberg.","DOI":"10.1007\/978-3-642-36095-4_18"},{"key":"ijertcs.2013070103-43","unstructured":"Yanyong, Z., & Celal, O. (2005). Enhancing source-location privacy in sensor network routing. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (pp. 599-608). Genova, Italy: IEEE Computer Society."},{"key":"ijertcs.2013070103-44","unstructured":"Yeung, C. A., Liccardi, I., Lu, K., Seneviratne, O., & Berners-lee, T. (2009). Decentralization: The future of online social networking. W3C Workshop on the Future of Social Networking Position Papers. Barcelona."},{"key":"ijertcs.2013070103-45","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2010.2051468"}],"container-title":["International Journal of Embedded and Real-Time Communication Systems"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=96966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:24:03Z","timestamp":1654097043000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijertcs.2013070103"}},"subtitle":["An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications"],"short-title":[],"issued":{"date-parts":[[2013,7,1]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"URL":"https:\/\/doi.org\/10.4018\/ijertcs.2013070103","relation":{},"ISSN":["1947-3176","1947-3184"],"issn-type":[{"value":"1947-3176","type":"print"},{"value":"1947-3184","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,1]]}}}