Reference Hub6
ECPDR: An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications

ECPDR: An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications

Mohamed Amine Ferrag, Mehdi Nafa, Salim Ghanemi
Copyright: © 2013 |Volume: 4 |Issue: 3 |Pages: 29
ISSN: 1947-3176|EISSN: 1947-3184|EISBN13: 9781466634374|DOI: 10.4018/ijertcs.2013070103
Cite Article Cite Article

MLA

Ferrag, Mohamed Amine, et al. "ECPDR: An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications." IJERTCS vol.4, no.3 2013: pp.43-71. http://doi.org/10.4018/ijertcs.2013070103

APA

Ferrag, M. A., Nafa, M., & Ghanemi, S. (2013). ECPDR: An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications. International Journal of Embedded and Real-Time Communication Systems (IJERTCS), 4(3), 43-71. http://doi.org/10.4018/ijertcs.2013070103

Chicago

Ferrag, Mohamed Amine, Mehdi Nafa, and Salim Ghanemi. "ECPDR: An Efficient Conditional Privacy-Preservation Scheme with Demand Response for Secure Ad hoc Social Communications," International Journal of Embedded and Real-Time Communication Systems (IJERTCS) 4, no.3: 43-71. http://doi.org/10.4018/ijertcs.2013070103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.