{"title":"A Highly Efficient Correlation Power Analysis on PRINT Cipher","authors":"Kan Yuan, Dawu Gu, Zheng Guo, Sigang Bao","doi":"10.1109/CIS.2012.105","DOIUrl":"https://doi.org/10.1109/CIS.2012.105","url":null,"abstract":"PRINT cipher is a lightweight block ciphers dedicated to integrated circuit (IC) printing, proposed by Lars Knudsen et al. at CHES 2010. Interestingly, PRINT cipher discards the key schedule part and keeps all its round keys identical. This unconventional design guarantees its modest space requirement. In this paper, however, we will show how to make use of its identical round key to mount a terrifically efficient DPA attack on PRINT cipher. On an round-based implementation of PRINTcipher-48, our attack is able to retrieve the complete secret key with merely 32 traces.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708727","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 Main Content of a Topic on Online Social Network by Multi-document Summarization","authors":"Chunyan Liu, Conghui Zhu, T. Zhao, Dequan Zheng","doi":"10.1109/CIS.2012.20","DOIUrl":"https://doi.org/10.1109/CIS.2012.20","url":null,"abstract":"Online social media has become one of the most important ways people communicate, while how to find valuable information from huge amounts of data becomes a key problem. We present a novel topic extraction method that employs topic value of each words and social model attributes as additional features based on the multi-document summarization. The experimental results show that the multi-document summarization with the topic and the sociality are helpful to extract topics from social media.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116326725","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":"Fast Multiple Scattering in Participating Media with Beamlet Decomposition","authors":"Yuanlong Wang, Ping Guo","doi":"10.1109/CIS.2012.95","DOIUrl":"https://doi.org/10.1109/CIS.2012.95","url":null,"abstract":"We propose a fast algorithm which is based on the beam let decomposition for real-time rendering of scenes in participating media with multiple scattering. Firstly, the light source radiation is considered as composed by all particles in the media and each particle radiation is decomposed along different forward directions using the plane decomposition method. Then the multiple scattering radiation of one particle is calculated by the decomposition radiations from its adjacent particles and the light source. Finally, according to the multiple scattering radiation value of each particle, the radiation of the ray which is from viewpoint is calculated using ray marching method, which can be implemented on the graphics processing unit (GPU), and rendering process is highly parallel. The experimental results show that the algorithm can achieve real-time rendering efficiency and enhance the practicality of multiple scattering.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651698","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":"Constitution of Linear Combinations of Idempotent Matrices and its Properties","authors":"Xingxiang Liu","doi":"10.1109/CIS.2012.124","DOIUrl":"https://doi.org/10.1109/CIS.2012.124","url":null,"abstract":"Constructing linear combinations of idempotent matrices is one of important issues. This paper firstly proposes the definition of n - by - n idempotent matrix of k. Then, the conditions that linear combination of idempotent matrix is idempotent matrix are proposed, also by using these properties, constructing method of idempotent matrix is given. Finally, the power of linear combination of idempotent matrix is discussed.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116666229","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":"Image Haze Removal of Wiener Filtering Based on Dark Channel Prior","authors":"Yanjuan Shuai, R. Liu, Wenzhang He","doi":"10.1109/CIS.2012.78","DOIUrl":"https://doi.org/10.1109/CIS.2012.78","url":null,"abstract":"If we use the image haze removal of dark channel prior, we're prone to color distortion phenomenon for some large white bright area in the image. Aimed at these problems, this paper presents an image haze removal of wiener filtering based on dark channel prior. The algorithm is mainly to estimate the median function in the use of the media filtering method based on the dark channel, to make the media function more accurate and combine with the wiener filtering closer. So that the fog image restoration problem is transformed into an optimization problem, and by minimizing mean-square error a clearer, fogless image is finally obtained. Experimental results show that the proposed algorithm can make the image more detailed, the contour smoother and the whole image clearer. In particular, this algorithm can recover the contrast of a large white area fog image. The algorithm not only compensates for the lack of dark channel prior algorithm, but also expands the application of dark channel prior algorithm and shortens the running time of the image algorithm.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"134 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115776695","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 Adaptive Image Denoising Model Based on Nonlocal Diffusion Tensor","authors":"Sun Xiao-li, Xu Chen, L. Min","doi":"10.1109/CIS.2012.70","DOIUrl":"https://doi.org/10.1109/CIS.2012.70","url":null,"abstract":"When denoising with the method of Weickert's anisotropic diffusion equation, the textures and details will be compromised. A fidelity term is added into Weickert's equation. The coefficient of fidelity term will vary adaptively with the instant image, which makes that the diffusion term and the fidelity term come to a better compromise. Otherwise, when deciding the edge directions, because of the strong smoothness of linear Gaussian function, a few other edge directions hiding in the main direction will be lost. To preserve these detailed edge directions, Gaussian kernel is substituted for nonlinear wavelet threshold. In addition, in order to preserving the textures and details as much as possible, a nonlocal diffusion tensor was introduced and the two eigenvalues are reset by combining the two methods: edge enhancing diffusion and coherence enhancing diffusion. Experiments show that the new model has obvious effect in preserving textures and details.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115608920","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":"Multi-Agent Evolutionary Clustering Algorithm Based on Manifold Distance","authors":"Xiaoying Pan, Hao Chen","doi":"10.1109/CIS.2012.35","DOIUrl":"https://doi.org/10.1109/CIS.2012.35","url":null,"abstract":"By using the manifold distance as the similarity measurement, a multi-agent evolutionary clustering algorithm based on manifold distance (MAEC-MD) is proposed in this paper. MAEC-MD designs a new connection based encoding, and the clustering results can be obtained by the process of decoding directly. It does not require the number of clusters to be known beforehand and overcomes the dependence of the domain knowledge. Aim at solving the clustering problem, three effective evolutionary operators are designed for competition, cooperation, and self-learning of an agent. Some experiments about artificial data, UCI data are tested. These results show that MAEC-MD can confirm the number of clusters automatically, tackle the data with different structures, and satisfy the diverse clustering request.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114842674","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":"TVPDc: A Model for Secure Managing Virtual Infrastructure in IaaS Cloud","authors":"Xin Wan, Xinfang Zhang, Liang Chen, Hao Jin","doi":"10.1109/CIS.2012.38","DOIUrl":"https://doi.org/10.1109/CIS.2012.38","url":null,"abstract":"We introduce a model for secure managing virtual infrastructure in IaaS Cloud which called Trusted Private Virtual Data center (TVPDc). It can offer centralized management of the computing and storage resources distributed in different locations and physical machines within an IaaS cloud. Additionally, we propose a hierarchical management framework and a TVPDc establishment and deployment protocol for the security architecture. The TVPDc model leverages trusted computing technology and develops to address the need for privacy protection and data security guarantees to enhance systems management capabilities in virtualized environments.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127142728","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 Simple and Effective Scheme of Ciphertext-Policy ABE","authors":"Minda Yu, Qiuliang Xu","doi":"10.1109/CIS.2012.122","DOIUrl":"https://doi.org/10.1109/CIS.2012.122","url":null,"abstract":"Since more sensitive data are stored and shared on third-party sites, we may need a system capable of one-to-many communication and data encryption without knowing specific recipients. However, the traditional public key crypto system and broadcast encryption system can't solve both of the problems at the same time. Attribute-Based Encryption (ABE) offers both of the desired abilities. In this paper, we present a simple and effective scheme of Cipher text-Policy Attribute-Based Encryption (CP-ABE), where access structures are single AND gates on positive and negative attributes and the size of access structure is fixed. Our scheme can be proven chosen plaintext attack (CPA) secure under the decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, we provide an implementation of our scheme and give performance measurements.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127414098","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}
Zhou Yinping, Shen Yulong, Pei Qingqi, Cui Xining, Liang Yahui
{"title":"Security Information Flow Control Model and Method in MILS","authors":"Zhou Yinping, Shen Yulong, Pei Qingqi, Cui Xining, Liang Yahui","doi":"10.1109/CIS.2012.138","DOIUrl":"https://doi.org/10.1109/CIS.2012.138","url":null,"abstract":"Multiple Independent Levels of Security (MILS) is a high-assurance architecture which protects information sharing at different security levels. MILS ensures mutual independence and prevents the spread of the error effectively between partitions. However, in some specific applications, there exists enormous amount of information interaction and sharing between partitions, the process of which has the problem of potential sensitive information leakage and tamper. From the point of view of information flow control, the article puts forward a model and method of security information flow control strictly between MILS partitions based on trusted computing. At first, we designed a lattice-based multi-level policy and a downgrading policy. The two policies not only automatically make the indirect information flow secure, but also break the traditional BLP model curt rules \"not read up, not write down\", which meet the needs of the security level of subjects and objects with the changes of task requirements in MILS. On this basis, a complete information flow control mechanism is established. By detailed analysis and verification, our information security flow security control method can effectively ensure that the information flow between partitions are all legitimate news after authorized by Separation Kernel and filtered by credible components, which can efficaciously protect the confidentiality and integrity of sensitive information.","PeriodicalId":294394,"journal":{"name":"2012 Eighth International Conference on Computational Intelligence and Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125306098","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}