Visible to the public Mobile Computing and Security

SoS Newsletter- Advanced Book Block

Mobile Computing

The section on mobile computing contains two compendia. The first, titled Recent Research in Mobile Security, lists articles and presentations from, among other sources, the International Symposium on Trust, Security, and Privacy for Emerging Applications held in November, 2013. The second, titled Mobile Computing and Security Articles--Part II, expands and updates the initial bibliography. A great deal of work is going on in mobile communications security. The articles cited here are deemed the most relevant for the Science of Security community because of their specific content.

  • "Improving the performance, availability, and security of data access for opportunistic mobile computing"; Stephen D. Smaldone. 2011. (ID#:14-1322) Doctoral Dissertation available at: Author's thesis statement: Opportunistic mobile computing can be achieved if critical challenges in the performance, availability, and security of user data access, introduced by the weakening of the binding between the user's data location and the environment from where it is accessed, are solved.
  • "Privacy & Security of Mobile Cloud Computing". Manmohan Chaturvedi, ,Sapna Malik, Preeti Aggarwal and Shilpa Bahl. Ansal University, Gurgaon, India May 2013. (ID#:14-1323) Available at: This papers enters the discussion of security and privacy challenges accompanying the rapid widespread use of mobile devices as a preferred platform. The term Mobile Cloud Computing (MCC), integrates both mobile applications and cloud service infrastructure, enabling effective use of a mobile device despite generally inadequate resources. This article focuses on the need for an efficient and secure framework with minimal drain on communication and mobile resources, which can be achieved through mobile-cloud services.
  • "A DFA with Extended Character-set for Fast Deep Packet Inspection," C. Liu, Y. Pan, A. Chen, and J. Wu, accepted to appear in IEEE Transactions on Computers. 2014. (ID#:14-1326) Available at: Deep packet inspection (DPI), based on regular expressions, is expressive, compact, and efficient in specifying attack signatures. The authors focus on their implementations based on general-purpose processors that are cost-effective and flexible to update. They propose a solution called "deterministic finite automata with extended character-set" (DFA/EC), which can significantly decrease the number of states through doubling the size of the character-set.
  • "A Two-stage Deanonymization Attack Against Anonymized Social Networks," W. Peng, F. Li, X. Zou, and J. Wu, accepted to appear in IEEE Transactions on Computers. 2014. (ID#:14-1327) Available at: The authors assert that digital traces left by users of online social networking services, even after anonymization, are susceptible to privacy breaches. This problem is exacerbated by the increasing overlap in user-bases among various services. The authors propose an algorithm, Seed-and-Grow, to identify users from an anonymized social graph, based solely on graph structure.
  • "Hop-by-Hop Message Authentication and Source Privacy in Wireless Sensor Networks," J. Li, Y. Li, J. Ren, and J. Wu, accepted to appear in IEEE Transactions on Parallel and Distributed Systems. 2014. (ID#:14-1328) Available at: Message authentication is one of the most effective ways to thwart unauthorized and corrupted messages from being forwarded in wireless sensor networks (WSNs). For this reason, many message authentication schemes have been developed, based on either symmetric-key cryptosystems or public-key cryptosystems. Most of them, however, have the limitations of high computational and communication overhead in addition to lack of scalability and resilience to node compromise attacks. To address these issues, a polynomial-based scheme was recently introduced. However, this scheme and its extensions all have the weakness of a built-in threshold determined by the degree of the polynomial: when the number of messages transmitted is larger than this threshold, the adversary can fully recover the polynomial. In this paper, we propose a scalable authentication scheme based on elliptic curve cryptography (ECC).
  • "Towards Differential Query Services in Cost-Efficient Clouds [supplemental]," Q. Liu, C. C. Tan, J. Wu, and G. Wang, accepted to appear in IEEE Transactions on Parallel and Distributed Systems. 2014. (ID#:14-1329) Available at: In this paper, the authors address two fundamental issues in such an environment: privacy and efficiency. We first review a private keyword-basedfile retrieval scheme that was originally proposed by Ostrovsky. Their scheme allows a user to retrieve files of interest from an untrusted server without leaking any information. The main drawback is that it will cause a heavy querying overhead incurred on the cloud, and thus goes against the original intention of cost efficiency. In this paper, we present a scheme, termed efficient information retrieval for ranked query (EIRQ), based on an aggregation and distribution layer (ADL), to reduce querying overhead incurred on the
  • "Symbol-Level Reliable Broadcasting of Sensitive Data in Error-Prone Wireless Networks," P. Ostovari, J. Wu, and A. Khreishah, accepted to appear in Journal of Parallel and Distributed Computing. 2014. (ID#:14-1330) Available at: This paper addresses the security challenges of reliable packet transmission over wireless networks, and proposes a unique retransmission approach, focusing on the differing weight of bits in the event of partial data delivery, to increase reliability. This research considers single and multiple packet transmission, using random linear network coding to maximize gain during potential partial data delivery.
  • "Behavioral Malware Detection in Delay Tolerant Networks [supplemental]," W. Peng, F. Li, X. Zou, and J. Wu, IEEE Transactions on Parallel and Distributed Systems, Vol. 25, No. 1, 2014, 53-63. (ID#:14-1331) Available at: The authors propose a general behavioral characterization of proximity malware which based on Naive Bayesian model, which has been successfully applied in non-DTN settings such as filtering email spams and detecting botnets. We identify two unique challenges for extending Bayesian malware detection to DTNs ("insufficient evidence vs. evidence collection risk" and "filtering false evidence sequentially and distributedly"), and propose a method, "look-ahead", to address the challenges. They propose two extensions to "look-ahead", dogmatic filtering and adaptive look-ahead, to address the challenge of "malicious nodes sharing false evidence". Real mobile network traces are used to verify the effectiveness of their proposed methods.
  • "User Requirements-Based Security Ranking in SSL Protocol," F. Qi, Z. Tang, G. Wang, and J. Wu, accepted to appear in The Journal of Supercomputing. 2014. (ID#:14-1333) Available at: This paper is central focus is the server is RSA decryption in a secure socket layer protocol (SSL) handshake, and the challenge to create a more time-efficient SSL session initialization. Instead of the conventional use of multiple certificate, the authors of this paper propose adopting unique certificates. The proposed optimization scheme, based on access control and requirements-aware security, suggest success in using varying public key sizes.
  • "Guest Editorial: In-Network Computation: Exploring the Fundamental Limits," Kumar, P.R.; Kushilevitz, Eyal; Manjunath, D.; Medard, Muriel; Orlitsky, Alon; Srikant, R., Selected Areas in Communications, IEEE Journal on , vol.31, no.4, pp.617,619, April 2013 (ID#:14-1334) Available at: Some of the early work on in-network computation, a term that is being applied to this class of problems, was on the asymptotic analysis of the number of transmissions needed to compute specific functions in noisy broadcast networks. The development of geometric random graph theory and its applicability to wireless networks led to an extending of the analysis to large, multihop wireless networks. A second approach, which in some sense predates the preceding class of problems, considers simple, we may even say simplistic, networks with a small number of correlated sources. A third approach is to analyze the communication complexity of computing functions. The preceding is a sample of the extant literature and we launched this special issue with the hope of consolidating the area and also provide a launch-pad for new problem formulations and applications. We are happy to note that we have been reasonably successful on both counts and this special issue contains papers that advance our understanding of the fundamental limits and also develop several interesting new strands of research. And there are also papers that analyze the performance of in-network computation in specific application environments.


Articles listed on these pages have been found on publicly available internet pages and are cited with links to those pages. Some of the information included herein has been reprinted with permission from the authors or data repositories. Direct any requests via Email to SoS.Project (at) for removal of the links or modifications to specific citations. Please include the ID# of the specific citation in your correspondence.