Graduate School and Research Center In communication systems

Privacy and confidentiality in context-based and epidemic forwarding

Shikfa, Abdullatif; Önen, Melek; Molva, Refik

"Computer Communications", Elsevier, Vol 33, N°13, August 2010

Autonomic and opportunistic communications require specific routing algorithms, like replication-based algorithms or context-based forwarding. In addition to confidentiality, privacy is a major concern for protocols which disseminate the context of their destination. In this paper, we focus on the confidentiality and privacy issue inherent to context-based protocols, in the framework of an original epidemic forwarding scheme, which uses context as a heuristic to limit the replication of messages. We define the achievable privacy level with respect to the trusted communities assumption, and the security implications. Indeed, privacy in such an environment raises challenging problems, which lead us to a solution based on refinements of two pairing-based encryption, namely searchable encryption and identity-based encryption. This new solution enables forwarding while preserving user privacy by allowing secure partial matches in the header and by enforcing payload confidentiality.

Document Doi Bibtex

Keywords:Privacy; Confidentiality; Bilinear pairings; Opportunistic communication; Context-based forwarding
Type:Journal
Language:English
Date:
Department:Networking and Security
Eurecom ref:3131
Copyright: © Elsevier. Personal use of this material is permitted. The definitive version of this paper was published in "Computer Communications", Elsevier, Vol 33, N°13, August 2010 and is available at : http://dx.doi.org/10.1016/j.comcom.2010.04.035
Bibtex: @article{EURECOM+3131, doi = {http://dx.doi.org/10.1016/j.comcom.2010.04.035}, year = {2010}, month = {08}, title = {{P}rivacy and confidentiality in context-based and epidemic forwarding}, author = {{S}hikfa, {A}bdullatif and {\"{O}}nen, {M}elek and {M}olva, {R}efik }, journal = {"{C}omputer {C}ommunications", {E}lsevier, {V}ol 33, {N}°13, {A}ugust 2010}, url = {http://www.eurecom.fr/publication/3131} }
See also: