{"title":"Implementing and Optimizing an Encryption Filesystem on Android","authors":"Zhaohui Wang, Rahul Murmuria, A. Stavrou","doi":"10.1109/MDM.2012.31","DOIUrl":"https://doi.org/10.1109/MDM.2012.31","url":null,"abstract":"The recent surge in popularity of smart handheld devices, including smart-phones and tablets, has given rise to new challenges in protection of Personal Identifiable Information (PII). Indeed, modern mobile devices store PII for applications that span from email to SMS and from social media to location-based services increasing the concerns of the end user's privacy. Therefore, there is a clear need and expectation for PII data to be protected in the case of loss, theft, or capture of the portable device. In this paper, we present a novel FUSE (File system in User space) encryption file system to protect the removable and persistent storage on heterogeneous smart gadget devices running the Android platform. The proposed file system leverages NIST certified cryptographic algorithms to encrypt the data-at-rest. We present an analysis of the security and performance trade-offs in a wide-range of usage and load scenarios. Using existing known micro benchmarks in devices using encryption without any optimization, we show that encrypted operations can incur negligible overhead for read operations and up to twenty (20) times overhead for write operations for I/O-intensive programs. In addition, we quantified the database transaction performance and we observed a 50% operation time slowdown on average when using encryption. We further explore generic and device specific optimizations and gain 10% to 60% performance for different operations reducing the initial cost of encryption. Finally, we show that our approach is easy to install and configure across all Android platforms including mobile phones, tablets, and small notebooks without any user perceivable delay for most of the regular Android applications.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127459010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Harikrishna G. N. Rai, K. Deepak, Shahanaz Syed, P. R. Krishna
{"title":"A Smart Mobile Application for Identifying Storage Location of Small Industrial Assets","authors":"Harikrishna G. N. Rai, K. Deepak, Shahanaz Syed, P. R. Krishna","doi":"10.1109/MDM.2012.71","DOIUrl":"https://doi.org/10.1109/MDM.2012.71","url":null,"abstract":"Automation of industrial asset management has gained significant attention due to recent breakthrough in technologies for object identification and tracking. Unavailability of small assets used in industrial assembly floors, owing to post use misplacement, impacts the productivity and results in erroneous information in inventory management systems. In this work we present a solution for identifying small industrial assets along with their storage location using a machine vision based approach. Proposed system will assist the store manager to track and consolidate industrial assets periodically on the assembly floor after production. We have developed a machine vision based application on a mobile handheld device for asset tracking. This application is capable of acquiring asset images and finding their storage location. A mobile application prototype is implemented on an open software platform for evaluation.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124893359","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Extracting Region of Interest (ROI) Details Using LBS Infrastructure and Web-Databases","authors":"Shivendra Tiwari, Saroj Kaushik","doi":"10.1109/MDM.2012.29","DOIUrl":"https://doi.org/10.1109/MDM.2012.29","url":null,"abstract":"The geographical areas that are considered to be popular and interesting are called Region of Interest (ROI). There are multiple sources that can be used for erecting the ROIs such as user trajectory, POI databases, internet news etc. A tourist spot, historical region, monuments, a forest reserve, city, state or country's administrative boundaries are considered as the ROI objects. The interesting facts of the regions can be used for on-the-spot infotainment (information + entertainment) while user is walking, driving or just sitting idle on the flight. One may want the information in different level of details based on the interests, travel direction, and speed. The best way to get the recent information is going through the internet news, discussion forums, and encyclopedias on the web. The challenge is that there is no universal database available that contains the region information along with the location based search capabilities. The maintaining the granularity of the information based on the size or the details of the region adds more challenges. The broader idea of our work is to use the existing LBS infrastructure to track the user and achieve other navigation objectives in the system. However, the freely available up-to-date internet infrastructure is used as the information source. Initially, the user location is determined by the conventional methods. In order to relate the location with the web content, we use the semantic labels associated to the underlying location. The semantic labels are fetched by using reverse geocoding that returns the local attractions, street city, state and country names etc. Then these labels are used to search the associated detailed content in the web. The region data is maintained in two forms i.e. locally populated database and the web databases. The locally populated database can be updated on the preconfigured time interval in order to avoid data staleness problem. We have used Wikipedia as the internet data source in our prototype. The further research is in progress extracting the ROI information from the POI databases with their spatial and non-spatial attributes.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"12 7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128300075","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Defending Location Privacy Using Zero Knowledge Proof Concept in Location Based Services","authors":"Priti Jagwani, Saroj Kaushik","doi":"10.1109/MDM.2012.23","DOIUrl":"https://doi.org/10.1109/MDM.2012.23","url":null,"abstract":"The increasing trend of embedding positioning capabilities (e.g., GPS) in mobile devices facilitates the widespread use of Location Based Services. For such applications to succeed, privacy and confidentiality are key issues. Over all privacy will have to be managed through a combination of technology, legislation, corporate policy, and social norms. There are many data privacy schemes including Zero Knowledge Proof (ZKP) those can be used for location privacy. ZKP is also useful for removing the bottleneck problem introduced by use of trusted third party. In the earlier work, authors proposed the concept of middleware architecture in which, request and response are not routed through middleware for every transaction. This has reduced the dependency on middleware. This paper presents correspondence between the authentication techniques used in above said architecture and zero knowledge proof technique. Use of the concept of zero knowledge proof for authentication and authorization in the domain of location based services is also explored.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126980037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
R. Krishna, T. J. V. R. K. M. K. Sayi, R. Mukkamala, P. K. Baruah
{"title":"Privacy-Preserving Data Management in Mobile Environments: A Partial Encryption Approach","authors":"R. Krishna, T. J. V. R. K. M. K. Sayi, R. Mukkamala, P. K. Baruah","doi":"10.1109/MDM.2012.47","DOIUrl":"https://doi.org/10.1109/MDM.2012.47","url":null,"abstract":"With the growing demand for data-sensitive applications employing mobile devices, such as mobile clinics in remote villages and remote sensors collecting sensitive data, there is a need for a new architectural paradigm for mobile data management. Typically, these mobile devices have limited storage and processing capabilities, and operate in unreliable environments leading to possible loss of valuable data, if not properly managed. Often, the collected data is periodically offloaded to a remote server such as a cloud. However, such offloading may lead to violation of privacy if the network/server cannot be fully trusted. While encrypting the data prior to offloading appears to be a solution for this problem, this is computationally intensive and infeasible when mobile devices are employed. In this paper, we propose a partial-encryption scheme that takes into account both the privacy (confidentiality) constraints of the data being collected and the limitations of the mobile devices. The scheme employs vertical and horizontal fragmentation to determine those parts that need to be encrypted and those that can be sent in clear. The privacy constraints are represented in terms of a constraint graph and two-coloring problem solution is applied to identify the portions of the data that need to be encrypted. Any cycles in the constraint graph are handled using heuristics. The approach is effective in integrating unsecured wireless/internet with the untrusted yet cheap cloud storage servers, using the capacity-constrained mobile devices to manage sensitive data.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127989266","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Kuldeep Yadav, S. K. Saha, P. Kumaraguru, Rohit Kumra
{"title":"Take Control of Your SMSes: Designing an Usable Spam SMS Filtering System","authors":"Kuldeep Yadav, S. K. Saha, P. Kumaraguru, Rohit Kumra","doi":"10.1109/MDM.2012.54","DOIUrl":"https://doi.org/10.1109/MDM.2012.54","url":null,"abstract":"Short Message Service (SMS) is one of the most frequently used services in the mobile phones, next to calls. In developing countries like India, SMS is the cheapest mode of communication. The advantage of this fact is exploited by the advertising companies to reach masses. The unsolicited SMS messages (a.k.a. spam SMS) generates notifications, thus consuming precious user attention. To formulate spam SMS problem and understand user's needs and preceptions, we conducted an online survey with 458 participants in different cities of India. Most of the survey participants admitted that they are quite annoyed with burst of SMS spams and in-effectiveness of regulatory solutions. However, some participants reported that, they do get useful information from spam SMSes sometime(e.g. discounts at a popular food joint). In this paper, we present design and implementation of a user-centric spam SMS filtering application i.e. SMSAssassin that uses content based machine learning techniques with user generated features to filter unwanted SMSes and reduces the burden of notifications for a mobile user.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115834525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
J. Gomes, S. Krishnaswamy, M. Gaber, Pedro A. C. Sousa, Ernestina Menasalvas Ruiz
{"title":"MARS: A Personalised Mobile Activity Recognition System","authors":"J. Gomes, S. Krishnaswamy, M. Gaber, Pedro A. C. Sousa, Ernestina Menasalvas Ruiz","doi":"10.1109/MDM.2012.33","DOIUrl":"https://doi.org/10.1109/MDM.2012.33","url":null,"abstract":"Mobile activity recognition focuses on inferring the current activities of a mobile user by leveraging the sensory data that is available on today's smart phones. The state of the art in mobile activity recognition uses traditional classification techniques. Thus, the learning process typically involves: i) collection of labelled sensory data that is transferred and collated in a centralised repository, ii) model building where the classification model is trained and tested using the collected data, iii) a model deployment stage where the learnt model is deployed on-board a mobile device for identifying activities based on new sensory data. In this paper, we demonstrate the Mobile Activity Recognition System (MARS) where for the first time the model is built and continuously updated on-board the mobile device itself using data stream mining. The advantages of the on-board approach are that it allows model personalisation and increased privacy as the data is not sent to any external site. Furthermore, when the user or its activity profile changes MARS enables quick model adaptation. One of the stand out features of MARS is that training/updating the model takes less than 30 seconds per activity. MARS has been implemented on the Android platform to demonstrate that it can achieve accurate mobile activity recognition. Moreover, we can show in practice that MARS quickly adapts to user profile changes while at the same time being scalable and efficient in terms of consumption of the device resources.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887267","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Georgios Chatzimilioudis, D. Zeinalipour-Yazti, Wang-Chien Lee, M. Dikaiakos
{"title":"Continuous All k-Nearest-Neighbor Querying in Smartphone Networks","authors":"Georgios Chatzimilioudis, D. Zeinalipour-Yazti, Wang-Chien Lee, M. Dikaiakos","doi":"10.1109/MDM.2012.19","DOIUrl":"https://doi.org/10.1109/MDM.2012.19","url":null,"abstract":"Consider a centralized query operator that identifies to every smartphone user its k geographically nearest neighbors at all times, a query we coin Continuous All k-Nearest Neighbor (CAkNN). Such an operator could be utilized to enhance public emergency services, allowing users to send SOS beacons out to the closest rescuers, allowing gamers and social networking users to establish ad-hoc overlay communication infrastructures, in order to carry out complex interactions. In this paper, we study the problem of efficiently processing a CAkNN query in a cellular or WiFi network, both of which are ubiquitous. We introduce an algorithm, coined Proximity, which answers CAkNN queries in O(n(k + λ)) time, where n denotes the number of users and λ a network-specific parameter (λ <;<; n). Proximity does not require any additional infrastructure or specialized hardware and its efficiency is mainly attributed to a smart search space sharing technique we introduce. Its implementation is based on a novel data structure, coined k+-heap, which achieves constant O(1) look-up time and logarithmic O(log(k*λ)) insertion/update time. Proximity, being parameter-free, performs efficiently in the face of high mobility and skewed distribution of users (e.g., the service works equally well in downtown, suburban, or rural areas). We have evaluated Proximity using mobility traces from two sources and concluded that our approach performs at least one order of magnitude faster than adapted existing work.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128933253","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Tracking the Dynamic Distribution of People in Indoor Space with Noisy Partitioning Sensors","authors":"Song Wang, X. Wang, Y. Huang","doi":"10.1109/MDM.2012.56","DOIUrl":"https://doi.org/10.1109/MDM.2012.56","url":null,"abstract":"The term \"indoor\" here refers generally to enclosed space partitioned into subspaces with connecting doors or gates. Examples include the inside of office buildings, amusement parks, and indoor shopping malls. In many applications, it is desirable to keep track of the distribution of people within the enclosed space. These applications range from smart house with automatically controlled air-conditioning and lighting, shopping assistance allocation, to business intelligence. Contact sensors are accurate but obstructive. Non-contact sensors such as automated visual recognition and RFID tags can be expensive in calibration or cost in order to obtain accurate readings. An interesting cost optimization problem is to understand how to obtain relatively accurate dynamic distribution of people from inaccurate point sensors using correlations among the point sensor readings. The paper formalizes a framework that uses a flow model and a particle-filter learning algorithm for this optimization problem based on the hypotheses that (1) there is an underlying stochastic \"flow model\" of people moving within the space, and (2) with the help of this flow model, counting of people can be made more accurate by taking advantage of the continuous, albeit inaccurate, point sensor readings. The main challenge is that the performance of particle filters deteriorates rapidly with the number of doors in the indoor space. We propose a divide and conquer method that uses relatively more accurate sensors at a few strategically chosen locations to achieve overall good accuracy. Experimental results given herein show that the algorithm is effective.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125325912","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"OptiMoS: Optimal Sensing for Mobile Sensors","authors":"Zhixian Yan, Julien Eberle, K. Aberer","doi":"10.1109/MDM.2012.43","DOIUrl":"https://doi.org/10.1109/MDM.2012.43","url":null,"abstract":"Both sensor coverage maximization and energy cost minimization are the fundamental requirements in the design of real-life mobile sensing applications, e.g., (1) deploying environmental sensors (like CO2, fine particle measurement) on public transports to monitor air pollution, (2) analyzing smart phone embedded sensors (like GPS, accelerometer) to recognize people daily activities. However sensor coverage and energy cost contradict each other: the higher frequency mobile sensing takes, the more energy is used, and vise versa. In this paper, we design a novel two-step mobile sensing process (\"OptiMoS\") to achieve optimal mobile sensing that can effectively balance sensor coverage and energy cost. In the first step, OptiMoS divides the continuous mobile sensor readings into several segments, where the readings in one segment are highly-correlated rather than readings amongst different segments. In the second step, OptiMoS identifies optimal sampling for the sensor readings in each segment, where the selected readings can guarantee reasonably high sensor coverage with limited sampling rate. Various greedy & near-optimal segmentation and sampling methods are designed in OptiMoS, and are evaluated using real-life environmental data from mobile sensors.","PeriodicalId":422293,"journal":{"name":"2012 IEEE 13th International Conference on Mobile Data Management","volume":"381 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126728412","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}