{"title":"A Semantic Access Control for Easy Management of the Privacy for EHR Systems","authors":"M. Sicuranza, Mario Ciampi","doi":"10.1109/3PGCIC.2014.84","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.84","url":null,"abstract":"In the last years, the increasingly use of ICT in Healthcare has led to the generation of several healthcare information systems, such as Electronic Health Record systems, which enable the management and sharing of digital clinical data. Since clinical data is generally characterized by very sensitive information, such information systems have to be able to limit their sharing of it, by enabling or denying access to the various healthcare users. In order to manage who can do what on such data, there is so need to use access control mechanisms, which have to be able to satisfy access policies defined by the patient in a dynamic manner. This paper presents a semantic access control designed for specifying flexible and fine-grained access policies in the HIS. The proposed model is based on an ontological approach able to increase the usability and feasibility of real information systems.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128314724","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":"Static-Dynamic Control Flow Integrity","authors":"Xiaolong Liu, Qiang Wei, Ziwei Ye","doi":"10.1109/3PGCIC.2014.58","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.58","url":null,"abstract":"CCFIR (Compact Control Flow Integrity and Randomization) has low performance overhead as an exploit mitigation, but it is hard to mitigate exploits by hijacking virtual function pointer, which are emerging in recent years. Because of the polymorphism of virtual functions, CCFIR can't determine a unique spring board stub. We propose a new practical protection method named SDCFI (Static-Dynamic Control Flow Integrity), whose goal is to protect virtual function pointers from hijacking. Taking advantage of static analysis result of IDA and PIN dynamic instrumentation, SDCFI improves the accuracy of the disassembly and identifies indirect call target addresses at runtime. We observe that there are always double 0x90 bytes for alignment in the gap between two functions, which can be substituted by a two-byte checkmark. Using the checkmark, SDCFI can validate a target more simply and faster than traditional CFI. Based on these approaches, SDCFI can prevent control-flow hijacking attacks including ROP, because the gadgets of stack pivot can't pass the validation. We evaluate our prototype implementation for Internet Explorer8 browser on Windows XP, which faces serious security threats since April 8, 2014. SDCFI protects most indirect call instructions in msthml.dll, and has low runtime overhead of 1.48% on average. Experiments on real-world exploits for IE8 browser also show that SDCFI can effectively mitigate exploits by hijacking virtual function pointer.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128570385","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}
Jingliang Liao, Yiqiao Cai, Yonghong Chen, Tian Wang, H. Tian
{"title":"Improving Differential Evolution with Ring Topology-Based Mutation Operators","authors":"Jingliang Liao, Yiqiao Cai, Yonghong Chen, Tian Wang, H. Tian","doi":"10.1109/3PGCIC.2014.43","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.43","url":null,"abstract":"Differential evolution (DE) has been proven to be a simple and powerful evolutionary algorithm, and obtains many successful applications in scientific and engineering fields. The mutation strategy plays the key role in DE for finding global optimal solutions. In most of the DE algorithms, the base and difference vectors are randomly selected from the current population. Furthermore, both the neighborhood and direction information are not fully and simultaneously exploited in the evolutionary process of DE. In order to alleviate this drawback and enhance the performance of DE, we employ the ring topology to construct neighborhood for each individual and introduce the direction information with the neighbors into the mutation operator of DE. The proposed DE is named as ring-DE in this paper. By this way, ring-DE can utilize the neighborhood and direction information simultaneously to guide the search of DE. In order to evaluate the effectiveness of the proposed method, ring-DE is incorporated into several original DE algorithms. Experimental results clearly show that ring-DE is able to enhance the performance of the DE algorithms studied.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130409969","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":"WDM-PON Breakpoint Precision Detection System Based Broadband Chaos Light","authors":"Dan Zou, Yuejin Zhang","doi":"10.1109/3PGCIC.2014.126","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.126","url":null,"abstract":"Break detection for WDM-PON needed to solve the multi-branch; node density problem for the realization of high-precision positioning of each branch proposed a breakpoint detection method based broadband chaotic light lasers. On the basis of analyzing the characteristics of broadband chaotic sources on a preliminary simulation results show that this method can be highly accurate positioning WDM-PON branch breakpoint location, spatial resolution of 7cm and independent of the detection distance.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"48 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129041356","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":"Developing Map Matching Algorithm for Transportation Data Center","authors":"Jian Huang, Chunwei Liu, Jinhui Qie","doi":"10.1109/3PGCIC.2014.52","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.52","url":null,"abstract":"Map matching (MM), pins the drifting position data to the correct road link on which a vehicle is travelling, is a crucial step needed by many industrial or research ITS projects which rely on post-hoc analysis of trajectories. To address the unprecedented challenge of massive GPS data processing in urban transportation data center nowadays, this paper proposed an improved parallel topological map-matching algorithm that aims to achieve highest efficiency as well as guaranteed accuracy. The main contributions of this work include: I) a weighting scheme based on cost-effectiveness ratio to reduce candidate path set in low time cost, II) a novel leapfrog method to omit the redundant GPS points that are not needed in path determination, III) parallelized processing using Map Reduce paradigm. Experiment show that these improvements greatly reduced algorithm's running time when compare to the state of the art.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128837733","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}
Zijing Cheng, Lei He, Jingling Zhao, Kai Lin, Baojiang Cui
{"title":"A Security Enhanced IEEE1588 Protocol for Deep-Space Environment","authors":"Zijing Cheng, Lei He, Jingling Zhao, Kai Lin, Baojiang Cui","doi":"10.1109/3PGCIC.2014.30","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.30","url":null,"abstract":"With the continuous development of the space technology, increasing communication between spacecrafts. To ensure the spacecrafts keep a uniform time standard, time synchronization protocol plays an crucial role. Taking account the characteristics of deep-space: poor link quality, limited node computing power, and the GNSS service is unstable, through the improving of IEEE1588 protocol, a autonomous time synchronization protocol for the space environment is presented, which security arrangement is relatively sound, does not depend on the GNSS service - Security Enhanced IEEE1588 for Space (SEIEEE1588).","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"79 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133173800","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":"Research on Online Measurement Method of Smartphone Energy Consumption","authors":"Jie Ma, Haiyang Yu, Xiaoli Gong, Xiaoyu Zhang","doi":"10.1109/3PGCIC.2014.90","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.90","url":null,"abstract":"Online power measurement is one of the power measurements in smartphones which would allow us to measure the energy consumption of smartphones without using external devices. This online method depends on a built-in BMU (Battery Monitoring Unit). BMU is a chip which can gather relative data of the battery and submit them to the upper level. The current data which BMUs submit in the past is the average current over a fixed period. Previously, we found some BMUs in smartphones which would transmit the instantaneous current directly instead of the average current. This kind of BMU shows different characteristic to the former one in the experiment of online testing. In this paper, we would measure the energy consumption of smart phone components by the online approach to show their feature of energy consumption in their different power states. And more, we will analyze the data to show the accuracy and make a comparison between them finally.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125465329","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 Asynchronous Periodic Sequential Patterns Mining Algorithm with Multiple Minimum Item Supports","authors":"Xiangzhan Yu, Haining Yu","doi":"10.1109/3PGCIC.2014.76","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.76","url":null,"abstract":"Original sequential pattern mining model only considers occurrence frequentness of sequential patterns, disregards their occurrence periodicity. We propose the asynchronous periodic sequential pattern mining model to discover the sequential patterns which are not only occurring frequently, but also appearing periodically. For this mining model, we propose a pattern-growth mining algorithm to mine asynchronous periodic sequential patterns with multiple minimum item supports. This algorithm employs a dividing and rule method to mine asynchronous periodic sequential pattern recursively and depth first. Experimental results show the efficiency and stability of the algorithm.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126528353","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}
Huixia Luo, Guidong Zhang, Yongjun Shen, Jialin Hu
{"title":"Mixed Fruit Fly Optimization Algorithm Based on Lozi's Chaotic Mapping","authors":"Huixia Luo, Guidong Zhang, Yongjun Shen, Jialin Hu","doi":"10.1109/3PGCIC.2014.54","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.54","url":null,"abstract":"Mixed Fruit Fly Optimization Algorithm LGM-FOA (Logistic Mapping-FOA) is an improved mixed fruit fly algorithm on the basis of the Logistic map, but the algorithm was showing an ideal state about convergence precision and stability in the optimization process, because there are three discontinuous points from the Logistic map. To solve this problem, the author proposed a new mixed fruit fly algorithm. The algorithm uses the Lozi's map to have a global search for the optimal parameter values instead of Logistic map. It uses the value as the center to do tiny fluctuations to obtain Final optimal value of quadratic optimization, and improves the initial value selection method of LGM-FOA. In support of the simulation between vector machine regression forecast and the original Fruit Fly Algorithm, Particle Swarm Optimization (PSO), LGM-FOA, the result testifies that the convergence accuracy of this new mixed fruit fly algorithm has obvious advantages.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129461042","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":"A Statistical Integrity Authentication Scheme without Grouping for Streaming Data","authors":"Xi Shi","doi":"10.1109/3PGCIC.2014.108","DOIUrl":"https://doi.org/10.1109/3PGCIC.2014.108","url":null,"abstract":"The development of the sensor networks has enabled increasing commercial or scientific applications in which data are available as streams. And sometimes the core security requirement of streaming data in WSNs is integrity rather than confidentiality. Former stream authentication schemes based on watermarking usually suffer from the vulnerability of grouping. This paper proposed a novel integrity authentication scheme for streaming data. Copies of data elements are buffered in the queue instead of being divided into groups, and parts of the queue are selected randomly and uniformly according to probability to compute one-bit watermark. So, any data element will be verified by the statistical judging of its related one-bit watermarks. Low false negative rate results from several watermarks, and the watermarks related with certain data element will be distributed uniformly in the queue, which results in low false positive rate. The proposed method resolves a series of vulnerability issues from grouping, and the cost of integrity is composed of a small amount of computational overhead and some storage space. Our scheme is ideal for applications with real-time needs and limited resources in WSNs.","PeriodicalId":395610,"journal":{"name":"2014 Ninth International Conference on P2P, Parallel, Grid, Cloud and Internet Computing","volume":"08 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127251444","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}