Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00100
Zhenhua Liu, Yaohui Liu
Searchable encryption ensures that data user can search over encrypted data stored by data owner's in cloud. However, since the cloud server is semi-trusted, it may tamper information that stored by data owners. In order to obtain data owner's information, the unauthorized users can send search requests to the cloud sercer, and it may return search results to the unauthorized users, which may lead to the leakage of information. Moreover, since different documents are encrypted with different secret keys, it is impractical for data users to search over massive documents. Aiming at these problems, we propose a searchable encryption scheme that supports verification and authentication with aggregate key. In the proposed scheme, data user interacts with the cloud server to obtain information, and uses these information to verify the integrity of ciphertexts. The cloud server can authenticate the legality of data user by authenticating whether data user's identity is contained in the authorized users' identity set. Data owner sends an aggregate key to the authorized users so as to share search permissions on his documents selectively. Finally, security and performance analysis show that the scheme is secure and efficient.
{"title":"Verifiable and Authenticated Searchable Encryption Scheme with Aggregate Key in Cloud Storage","authors":"Zhenhua Liu, Yaohui Liu","doi":"10.1109/CIS2018.2018.00100","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00100","url":null,"abstract":"Searchable encryption ensures that data user can search over encrypted data stored by data owner's in cloud. However, since the cloud server is semi-trusted, it may tamper information that stored by data owners. In order to obtain data owner's information, the unauthorized users can send search requests to the cloud sercer, and it may return search results to the unauthorized users, which may lead to the leakage of information. Moreover, since different documents are encrypted with different secret keys, it is impractical for data users to search over massive documents. Aiming at these problems, we propose a searchable encryption scheme that supports verification and authentication with aggregate key. In the proposed scheme, data user interacts with the cloud server to obtain information, and uses these information to verify the integrity of ciphertexts. The cloud server can authenticate the legality of data user by authenticating whether data user's identity is contained in the authorized users' identity set. Data owner sends an aggregate key to the authorized users so as to share search permissions on his documents selectively. Finally, security and performance analysis show that the scheme is secure and efficient.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128077717","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00053
Hengzhou Xu, Hai Zhu, Mengmeng Xu, Bo Zhang, Sifeng Zhu
Motivated by the works on the girth of Tanner (3,5), (3,7), (3,11), and (5,7) quasi-cyclic (QC) LDPC codes, we in this paper study the girth of Tanner (5,11) QC-LDPC codes. We first analyze the cycles of Tanner (5,11) QC-LDPC codes, and obtain the conditions for the existence of cycles of length less than 12 in Tanner (5,11) QC-LDPC codes of length 11p where p is a prime number and p =1 (mod 55). Notice that the condition is represented by the polynomial equations in a 55th root of unity of the prime field Fp. By checking the existence of solutions for these equations over Fp, the girths of Tanner (5,11) QC-LDPC codes are obtained.
{"title":"Girth Analysis of Tanner (5,11) Quasi-Cyclic LDPC Codes","authors":"Hengzhou Xu, Hai Zhu, Mengmeng Xu, Bo Zhang, Sifeng Zhu","doi":"10.1109/CIS2018.2018.00053","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00053","url":null,"abstract":"Motivated by the works on the girth of Tanner (3,5), (3,7), (3,11), and (5,7) quasi-cyclic (QC) LDPC codes, we in this paper study the girth of Tanner (5,11) QC-LDPC codes. We first analyze the cycles of Tanner (5,11) QC-LDPC codes, and obtain the conditions for the existence of cycles of length less than 12 in Tanner (5,11) QC-LDPC codes of length 11p where p is a prime number and p =1 (mod 55). Notice that the condition is represented by the polynomial equations in a 55th root of unity of the prime field Fp. By checking the existence of solutions for these equations over Fp, the girths of Tanner (5,11) QC-LDPC codes are obtained.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133113017","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00069
L. Tian, Yong Fan
Aiming at the problem that the beacon signal of SCAN algorithm can not effectively cover the monitoring area and the mobile node of PI algorithm has longer moving path, an improved mobile anchor node localization algorithm-SCAN_ET is proposed in this paper. Firstly, this algorithm divides the region where nodes need to be located into several small zones. Then it's key step is that-the mobile anchor node detects whether there are unknown nodes that need to be positioned in each local small zones. If there are unknown nodes to be located in some small zones, the mobile anchor node moves along the sides of triangular in these zones and broadcasts beacon packets at all the vertices of the triangle. Otherwise, the mobile anchor node moves in a straight line in these zones. Finally, when the mobile anchor node traverses the regions, all unknown nodes that need to be positioned also complete positioning. Simulation results show that by this method, not only can all the unknown nodes obtain the location information effectively, but also the mobile anchor node has a shorter traversal length compared with PI algorithm and LMAT algorithm, which is good for saving energy and prolonging service life.
{"title":"An Improved Location Algorithm Based on Mobile Anchor Node","authors":"L. Tian, Yong Fan","doi":"10.1109/CIS2018.2018.00069","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00069","url":null,"abstract":"Aiming at the problem that the beacon signal of SCAN algorithm can not effectively cover the monitoring area and the mobile node of PI algorithm has longer moving path, an improved mobile anchor node localization algorithm-SCAN_ET is proposed in this paper. Firstly, this algorithm divides the region where nodes need to be located into several small zones. Then it's key step is that-the mobile anchor node detects whether there are unknown nodes that need to be positioned in each local small zones. If there are unknown nodes to be located in some small zones, the mobile anchor node moves along the sides of triangular in these zones and broadcasts beacon packets at all the vertices of the triangle. Otherwise, the mobile anchor node moves in a straight line in these zones. Finally, when the mobile anchor node traverses the regions, all unknown nodes that need to be positioned also complete positioning. Simulation results show that by this method, not only can all the unknown nodes obtain the location information effectively, but also the mobile anchor node has a shorter traversal length compared with PI algorithm and LMAT algorithm, which is good for saving energy and prolonging service life.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"170 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121288808","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00066
Rong Shan, Tao Li
The nodes of mobile wireless sensor network have mobility, which leads to the change of network topology and signal strength. Therefore, the reliability of network service quality in mobile wireless sensor network has higher requirements. In the paper, the support vector machine (SVM) algorithm is used to identify and simulate faults in the mobile wireless sensor network, which can quickly locate fault nodes, thus providing guarantee for solving network faults and improving network reliability timely.
{"title":"Reliability Simulation of Mobile Wireless Sensor Networks Based on Support Vector Machines","authors":"Rong Shan, Tao Li","doi":"10.1109/CIS2018.2018.00066","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00066","url":null,"abstract":"The nodes of mobile wireless sensor network have mobility, which leads to the change of network topology and signal strength. Therefore, the reliability of network service quality in mobile wireless sensor network has higher requirements. In the paper, the support vector machine (SVM) algorithm is used to identify and simulate faults in the mobile wireless sensor network, which can quickly locate fault nodes, thus providing guarantee for solving network faults and improving network reliability timely.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128541808","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}
Pub Date : 2018-11-01DOI: 10.1109/cis2018.2018.00079
Can-Hui Zhang
By utilizing the analytic hierarchy process (AHP) and the related content of fuzzy mathematics, this pap er introduced an actual case of administrative institution in C hina and comprehensively assessed its internal control throug h establishing appropriate indicators evaluation system and e valuation function, as well as proposing some specific solutio ns. To some extend, this verified the validity and feasibility o f evaluation index for the internal control. References for con structing the internal control of administrative institutions in our country would also be provided.
{"title":"Internal Control Measure of Administrative Institutions Based on AHP and Fuzzy Comprehensive Evaluation","authors":"Can-Hui Zhang","doi":"10.1109/cis2018.2018.00079","DOIUrl":"https://doi.org/10.1109/cis2018.2018.00079","url":null,"abstract":"By utilizing the analytic hierarchy process (AHP) and the related content of fuzzy mathematics, this pap er introduced an actual case of administrative institution in C hina and comprehensively assessed its internal control throug h establishing appropriate indicators evaluation system and e valuation function, as well as proposing some specific solutio ns. To some extend, this verified the validity and feasibility o f evaluation index for the internal control. References for con structing the internal control of administrative institutions in our country would also be provided.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128637080","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00097
Qiang Chen
In order to make massive network data storage possible in heterogeneous environment, this paper introduces node performance evaluation method and data storage node selection algorithm in HDFS data storage mechanism. First of all, this paper describes how to evaluate each node in Hadoop cluster. And then, according to the result of node performance evaluation, the appropriate nodes are selected to store data blocks when data are stored. Through this algorithm, the number of data blocks placed in each node is allocated according to the performance value of the node.
{"title":"Massive Data Storage Algorithm Based on Node Performance Evaluation","authors":"Qiang Chen","doi":"10.1109/CIS2018.2018.00097","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00097","url":null,"abstract":"In order to make massive network data storage possible in heterogeneous environment, this paper introduces node performance evaluation method and data storage node selection algorithm in HDFS data storage mechanism. First of all, this paper describes how to evaluate each node in Hadoop cluster. And then, according to the result of node performance evaluation, the appropriate nodes are selected to store data blocks when data are stored. Through this algorithm, the number of data blocks placed in each node is allocated according to the performance value of the node.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129137807","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00109
Xiuni Yang, Yunfeng Yang
This paper considers the pricing problem of European options. We will generalize the jump-diffusion option pricing formula by incorporating stochastic interest rates. Under the hypothesis of underlying asset price being driven by a jump-diffusion process that is a kind of special renewal process discussed the option pricing when interest rate is random variable, the formula of European options for dividend paying securities is deduced. Hence the results in R.C.Merton are generalized.
{"title":"Option Pricing under Stochastic Interest Rates","authors":"Xiuni Yang, Yunfeng Yang","doi":"10.1109/CIS2018.2018.00109","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00109","url":null,"abstract":"This paper considers the pricing problem of European options. We will generalize the jump-diffusion option pricing formula by incorporating stochastic interest rates. Under the hypothesis of underlying asset price being driven by a jump-diffusion process that is a kind of special renewal process discussed the option pricing when interest rate is random variable, the formula of European options for dividend paying securities is deduced. Hence the results in R.C.Merton are generalized.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115617703","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}
Pub Date : 2018-11-01DOI: 10.1109/cis2018.2018.00005
{"title":"CIS 2018 Preface","authors":"","doi":"10.1109/cis2018.2018.00005","DOIUrl":"https://doi.org/10.1109/cis2018.2018.00005","url":null,"abstract":"","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126131602","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00094
Xuening Quan, Wenzhang He
Reconstruction of high-quality images by few-view projections is a challenge faced by computed tomography. Based on guided image filtering, a new image reconstruction algorithm is presented to reconstruct image. Specially, the guided image is identical to the reconstructed image. The new reconstruction algorithm was applied to the few-view projections. The experimental results show that the new technique can improve the image quality over the compared method.
{"title":"Image Reconstruction Algorithm Based on Guided Image Filtering in Parallel-Beam CT","authors":"Xuening Quan, Wenzhang He","doi":"10.1109/CIS2018.2018.00094","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00094","url":null,"abstract":"Reconstruction of high-quality images by few-view projections is a challenge faced by computed tomography. Based on guided image filtering, a new image reconstruction algorithm is presented to reconstruct image. Specially, the guided image is identical to the reconstructed image. The new reconstruction algorithm was applied to the few-view projections. The experimental results show that the new technique can improve the image quality over the compared method.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123819750","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}
Pub Date : 2018-11-01DOI: 10.1109/CIS2018.2018.00037
Hui Du, Zhihe Wang, Dan Wang, Xiaoli Wang
Texture patterns are complex and varied, and their applications are diverse. In many cases, the effect of image segmentation by a single texture feature extraction method is not ideal. In response to this problem, this paper proposes a multi-feature fusion method to process the texture feature extraction. The proposed method combines the gray level co-occurrence matrix (GLCM), Gabor wavelet transform and local binary pattern (LBP). It has the advantages of the above three texture feature extraction methods. Then, we use the algorithm K-means to implement the image segmentation by clustering the extracted texture features. As a result, the proposed algorithm can precisely realize the clustering for texture image segmentation. The experimental results show that the proposed algorithm is more efficient than the single texture feature extraction methods.
{"title":"Multi-Feature Fusion Method Applied in Texture Image Segmentation","authors":"Hui Du, Zhihe Wang, Dan Wang, Xiaoli Wang","doi":"10.1109/CIS2018.2018.00037","DOIUrl":"https://doi.org/10.1109/CIS2018.2018.00037","url":null,"abstract":"Texture patterns are complex and varied, and their applications are diverse. In many cases, the effect of image segmentation by a single texture feature extraction method is not ideal. In response to this problem, this paper proposes a multi-feature fusion method to process the texture feature extraction. The proposed method combines the gray level co-occurrence matrix (GLCM), Gabor wavelet transform and local binary pattern (LBP). It has the advantages of the above three texture feature extraction methods. Then, we use the algorithm K-means to implement the image segmentation by clustering the extracted texture features. As a result, the proposed algorithm can precisely realize the clustering for texture image segmentation. The experimental results show that the proposed algorithm is more efficient than the single texture feature extraction methods.","PeriodicalId":185099,"journal":{"name":"2018 14th International Conference on Computational Intelligence and Security (CIS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126324426","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：