{"title":"Private Substring Search on Homomorphically Encrypted Data","authors":"Yu Ishimaki, Hiroki Imabayashi, H. Yamana","doi":"10.1109/SMARTCOMP.2017.7947038","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947038","url":null,"abstract":"With the rapid development of cloud storage services and IoT environment, how to securely and efficiently search without compromising privacy has been an indispensable problem. In order to address such a problem, much works have been proposed for searching over encrypted data. Motivated by storing sensitive data such as genomic and medical data, substring search for encrypted data has been studied. Previous work either leaks query access pattern using vulnerable cryptographic model or performs search over plaintext data by an encrypted query. Thus they are not compatible with outsourcing scenario where searched data is stored in encrypted form which is searched by an encrypted substring query without leaking query access pattern, i.e., private substring search. In order to perform private substring search, Fully Homomorphic Encryption (FHE) can be adopted although it induces computationally huge overhead. Because of the huge overhead, performing private substring search efficiently over FHE is a challenging task. In this work, we propose a private substring search protocol over encrypted data by adopting FHE followed by examining its feasibility. In particular, we make use of batching technique which can accelerate homomorphic computation in SIMD manner. In addition, we propose a data structure which can be useful to specific searching function for batched computation. Our experimental result showed our proposed method is feasible.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129737680","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}
Maurizio Giacobbe, A. Puliafito, R. D. Pietro, M. Scarpa
{"title":"A Context-Aware Strategy to Properly Use IoT-Cloud Services","authors":"Maurizio Giacobbe, A. Puliafito, R. D. Pietro, M. Scarpa","doi":"10.1109/SMARTCOMP.2017.7946976","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7946976","url":null,"abstract":"Nowadays, we can talk about the Internet of Things (IoT) and Cloud computing union to indicate a new generation of distributed system. An IoT-Cloud system mainly consists of a set of smart objects which are interconnected through the Internet with a remote Cloud infrastructure, platform, or software. It allows to achieve new benefits in several contexts, such as smart cities and industrial businesses. In this paper we propose a context-aware strategy focused on the correct use of the IoT-Cloud services. In particular, a use case driven scenario and a three-step algorithm to define the strategy are presented and discussed.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115074396","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}
Zhiguang Tang, Haihang Zhou, Yujin Zhu, Run Tian, Jianguo Yao
{"title":"Quantitative Availability Analysis of Hierarchical Datacenter under Power Oversubscription","authors":"Zhiguang Tang, Haihang Zhou, Yujin Zhu, Run Tian, Jianguo Yao","doi":"10.1109/SMARTCOMP.2017.7947039","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947039","url":null,"abstract":"From the perspective of economic and efficient benefits, modern data center oversubscribes power supplies to deploy as many servers as possible. The oversubscription is based on the varied loads among servers to modulate power demand. Nevertheless, power oversubscription has potential threats to system availability, the data center may collapse as a result of overloading. Current solutions to the oversubscription usually focus on managing the datacenter workload to avoid the peak power demand time in the data center. However, none of the current research considers the influence of the failure of the power or utility components, where the component failure may affect the effectiveness of these strategies. Meanwhile, none of these current research can answer the question that how many servers should be deployed in the data centers under an availability constraint. In this paper, we propose quantitative availability analysis of hierarchical datacenter under power oversubscription. To this end, we use Markov chain and Stochastic Reward Net (SRN) to model the failure and repair processes of data center components. The servers at the bottom level are distributed in two pools: main pool and backup pool, where running servers are in main pool and turned-off servers in backup pool. Migration from backup pool to main pool is conducted once any running server fails. SRNs are implemented to model these two pools, and Markov chain is used to model the components in the upper level. The evaluation is based on the real-life Google and Wikipedia traces. The result shows the relationship between oversubscription and data center availability, which can guide the data center operators to choose the appropriate oversubscription ratio under the availability constraint.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114368415","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":"EliMO: Eliminating Channel Feedback from MIMO","authors":"Yongsen Ma, Gang Zhou, Shan Lin","doi":"10.1109/SMARTCOMP.2017.7947004","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947004","url":null,"abstract":"MIMO beamforming provides high throughput for WiFi networks, but it also leads to high computation and communication overhead due to Channel State Information (CSI) feedback. Explicit CSI feedback provides high beamforming gains, but it introduces extremely high overhead. Implicit CSI feedback has low overhead, but it provides very low beamforming gains. We propose EliMO to completely Eliminate CSI feedback from MIMO without sacrificing beamforming gains. EliMO uses two-way channel estimation to allow WiFi Access Points (AP) to accurately estimate downlink CSI without explicit CSI feedback. To measure downlink CSI at the WiFi AP, the WiFi station (STA) puts the received signal of downlink training symbols into Feedback Training Field (FTF) and sends it back to the AP. The AP estimates the two-way channel using the received signal of FTF. Analysis and experiment results show that EliMO is able to provide as high beamforming gains as explicit CSI feedback and as low overhead as implicit CSI feedback. EliMO significantly reduces computation and communication costs of measuring and sending CSI feedback for smart devices, like smartphones, smartwatches, and wireless drones. We evaluate the throughput and energy consumption of EliMO by experiment measurements in both static and mobile scenarios. Evaluation results show that EliMO provides 5× and 4× throughput as implicit and explicit CSI feedback, espectively. Energy consumption of EliMO is only 85%/30% of that of implicit/explicit CSI feedback.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124105991","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":"An Exploratory Study of Marking Menu Selection by Visually Impaired Participants","authors":"Nem Khan Dim, Kibum Kim, Xiangshi Ren","doi":"10.1109/SMARTCOMP.2017.7946986","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7946986","url":null,"abstract":"Although there have been recent advances in smartphone accessibility for blind people, they rely on screen readers and voice commands which are not ideal for users with visual impairment in mobile situations. By contrast, recent research has shown that marking menus would be beneficial to users' eyes-free interactions. However, the literature lacks accessibility implications and adaptation to the needs of blind people. This paper investigates blind people's capabilities to perform marking menu selections using the 3D motion of a smartphone in order to invoke smartphone functions. We present the bounds and range of marking gestures that a blind person can perform at each level, and the number of levels that a blind person can successfully cope with. Based on the experiment results, we also presented design guidelines.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132693256","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":"FitBeat: A Lightweight System for Accurate Heart Rate Measurement during Exercise","authors":"Linlin Tu, Jun Huang, Chongguang Bi, G. Xing","doi":"10.1109/SMARTCOMP.2017.7947009","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947009","url":null,"abstract":"Tracking heart rate for fitness using wrist-type wearables is challenging, because of the significant noise caused by intensive wrist movements. In this paper, we present FitBeat - a lightweight system that enables accurate heart rate tracking on wrist-type wearables during intensive exercises. Unlike existing approaches that rely on computation- intensive signal processing, FitBeat integrates and augments standard filter and spectral analysis tool, which achieves comparable accuracy while significantly reducing computational overhead. FitBeat integrates contact sensing, motion sensing and simple spectral analysis algorithms to suppress various error sources. We implement FitBeat on a COTS smartwatch, and evaluate the performance of FitBeat for typical workouts of different intensities, including walking, running and riding. Experimental results involving 10 subjects show that the average error of FitBeat is around 4 beats per minute, which improves heart rate accuracy of the default heart rate tracker of Moto 360 by 10x.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302008","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}
Philippe Massonet, Laurent Deru, Amel Achour, S. Dupont, A. Levin, M. Villari
{"title":"End-To-End Security Architecture for Federated Cloud and IoT Networks","authors":"Philippe Massonet, Laurent Deru, Amel Achour, S. Dupont, A. Levin, M. Villari","doi":"10.1109/SMARTCOMP.2017.7947005","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947005","url":null,"abstract":"Smart Internet of Things (IoT) applications will rely on advanced IoT platforms that not only provide access to IoT sensors and actuators, but also provide access to cloud services and data analytics. Future IoT platforms should thus provide connectivity and intelligence. One approach to connecting IoT devices, IoT networks to cloud networks and services is to use network federation mechanisms over the internet to create network slices across heterogeneous platforms. Network slices also need to be protected from potential external and internal threats. In this paper we describe an approach for enforcing global security policies in the federated cloud and IoT networks. Our approach allows a global security to be defined in the form of a single service manifest and enforced across all federation network segments. It relies on network function virtualisation (NFV) and service function chaining (SFC) to enforce the security policy. The approach is illustrated with two case studies: one for a user that wishes to securely access IoT devices and another in which an IoT infrastructure administrator wishes to securely access some remote cloud and data analytics services.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129129500","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}
Shigeng Zhang, Danming Jiang, Qing Zou, Jianxin Wang, Xuan Liu
{"title":"A High Throughput Reader Scheduling Algorithm for Large RFID Systems in Smart Environments","authors":"Shigeng Zhang, Danming Jiang, Qing Zou, Jianxin Wang, Xuan Liu","doi":"10.1109/SMARTCOMP.2017.7946979","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7946979","url":null,"abstract":"Radio Frequency IDentification (RFID) plays a vital role in smart computing applications. Due to the limited communication range of individual RFID readers, large RFID systems deployed in real applications usually contain multiple readers. Existing reader scheduling algorithms either disallow adjacent readers to simultaneously work in order to avoid collisions among them, or simply activate all the readers to work together to exploit the parallel working of readers to increase identification throughput. In this paper, we propose a reader scheduling algorithm that tolerates collisions among readers but selects an optimal set of readers that can maximize tag identification throughput to work in parallel. The proposed algorithm thus achieves much higher tag identification throughput than existing solutions. Experiment results in a small testbed containing three readers show that, compared with the state-of-the-art solution, the proposed algorithm enhances tag identification throughput by 40%. Results from extensive simulation experiments further demonstrate that the proposed algorithm performs much better than existing solutions in large RFID systems. For example, the proposed algorithm achieves 132% higher identification throughput than previous best solution in systems containing more than one hundred readers when the readers are randomly deployed, meanwhile achieves much smaller identification delay.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117007640","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":"Stoop: Stochastically-Dominant Access Point Selection in Enterprise WLANs","authors":"Yu Bai, M. Vuran, Demet Batur, S. Goddard","doi":"10.1109/SMARTCOMP.2017.7947049","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947049","url":null,"abstract":"In this work, two access point (AP) selection mechanisms called STOOP and MD-STOOP are presented for enterprise wireless local area networks (WLANs). STOOP utilizes first- order stochastic dominance (FSD) tools to develop a runtime algorithm that probes the network to compare the quality of service from multiple APs in a stochastic manner. MD-STOOP utilizes the concept of mean dominance (MD) to select APs, which provides good average case performance with less overhead than STOOP. Performance of the two algorithms is evaluated through extensive simulations in comparison to the state-of-the-art. It is shown that STOOP and MD-STOOP outperform existing solutions and directions for further improvements are discussed.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116016544","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":"Ubiquitous Tracking Using Motion and Location Sensor with Application to Smartphone","authors":"Lei Wang, Li Feng, M. Zawodniok","doi":"10.1109/SMARTCOMP.2017.7947056","DOIUrl":"https://doi.org/10.1109/SMARTCOMP.2017.7947056","url":null,"abstract":"In this paper, a cost efficient fusion scheme, Ubiquitous Tracking with Motion and Location Sensor (UTMLS), is proposed for the accurate localization and tracking in mixed GPS-friendly, GPS-challenging, and GPS-denied scenario. The proposed drift-reduction method in UTMLS addresses the cumulating error issue in the indoor tracking with the consumer grade motion sensor. The proposed hypothesis test method in UTMLS improves the tracking sensor fusion precision by detecting distorted GPS reports and intelligently switching between GPS and inertial sensor based schemes. The proposed scheme is instantiated and implemented on an Android smartphone platform. Experiments have been conducted to evaluate and validate the accuracy. Experimental results show that 1) the proposed drift-reduction method effectively suppresses the non-GPS tracking error accumulation due to the integration of acceleration noise with time 2) UTMLS realizes robust indoor/outdoor seamless tracking, preventing GPS fault estimates introduced tracking error in the conventional Kalman filtering process.","PeriodicalId":193593,"journal":{"name":"2017 IEEE International Conference on Smart Computing (SMARTCOMP)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121292266","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}