The Community for Technology Leaders
Green Image
Issue No. 03 - July-Sept. (2014 vol. 7)
ISSN: 1939-1374
pp: 373-386
Claudio A. Ardagna , Dipartimento di Informatica, Università degli Studi di Milano, Crema, Italy
Mauro Conti , Dipartimento di Matematica, Università di Padova, Padova, Italy
Mario Leone , Dipartimento di Matematica, Università di Padova, Padova, Italy
Julinda Stefa , Dipartimento di Informatica, Sapienza Università di Roma, Roma, Italy
The increasing spread of mobile cloud computing paradigm is changing the traditional mobile communication infrastructure. Today, smartphones can rely on virtual (software) “clones” in the cloud, offering backup/recovery solutions as well as the possibility to offload computations. As a result, clones increase the communication and computation capabilities of smartphones, making their limited batteries last longer. Unfortunately, mobile cloud introduces new privacy risks, since personal information of the communicating users is distributed among several parties (e.g., cellular network operator, cloud provider). In this paper, we propose a solution implementing an end-to-end anonymous communication protocol between two users in the network, which leverages properties of social networks and ad hoc wireless networks. We consider an adversary model where each party observing a portion of the communication possibly colludes with others to uncover the identity of communicating users. We then extensively analyze the security of our protocol and the anonymity preserved against the above adversaries. Most importantly, we assess the performance of our solution by comparing it to Tor on a real testbed of 36 smartphones and relative clones running on Amazon EC2 platform.
Cloning, Receivers, Mobile communication, Smart phones, Cryptography, Protocols, Social network services,smartphone clones, Anonymity, mobile cloud computing, mobile communications
Claudio A. Ardagna, Mauro Conti, Mario Leone, Julinda Stefa, "An Anonymous End-to-End Communication Protocol for Mobile Cloud Environments", IEEE Transactions on Services Computing, vol. 7, no. , pp. 373-386, July-Sept. 2014, doi:10.1109/TSC.2014.2304717
181 ms
(Ver 3.3 (11022016))