Integration of colleges and universities continue to expand, how the network soft, hard resource deployment and configuration become a difficult problem. After analyzing the university network funding, regional differences, and the current life of the computer and use efficiency, In the cloud computing environment using virtualization technology, cost savings and improve the software and hardware efficiency in the use of network resources building programs have been proposed. Proven, cloud computing model in the university network construction costs, efficiency in the use, energy consumption, management and maintenance of superiority.
{"title":"University Network-Design Based on Cloud Computing","authors":"He Xueni","doi":"10.1109/INCoS.2013.53","DOIUrl":"https://doi.org/10.1109/INCoS.2013.53","url":null,"abstract":"Integration of colleges and universities continue to expand, how the network soft, hard resource deployment and configuration become a difficult problem. After analyzing the university network funding, regional differences, and the current life of the computer and use efficiency, In the cloud computing environment using virtualization technology, cost savings and improve the software and hardware efficiency in the use of network resources building programs have been proposed. Proven, cloud computing model in the university network construction costs, efficiency in the use, energy consumption, management and maintenance of superiority.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130145026","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}
Multi-resolution analysis has been known to be effective for face recognition, however, most approaches only utilize scale and position information of different scales of decomposed image, only a few approaches utilize directional information. To investigate the potential of shear lets direction, this paper presents a new method for face description and recognition using shear lets transform and principle component analysis. Motivated by multi-resolution analysis, face images are performed by shear lets transform, and then directional information is exploited along with conventional scaling and translation parameters. Finally, face feature is extracted by principle component analysis. Experimental results on ORL and FERET face database show that the proposed method can get high face recognition rates.
{"title":"Face Recognition Based on Shearlets Transform and Principle Component Analysis","authors":"Zhiyong Zeng, Jian-Qiang Hu","doi":"10.1109/INCoS.2013.134","DOIUrl":"https://doi.org/10.1109/INCoS.2013.134","url":null,"abstract":"Multi-resolution analysis has been known to be effective for face recognition, however, most approaches only utilize scale and position information of different scales of decomposed image, only a few approaches utilize directional information. To investigate the potential of shear lets direction, this paper presents a new method for face description and recognition using shear lets transform and principle component analysis. Motivated by multi-resolution analysis, face images are performed by shear lets transform, and then directional information is exploited along with conventional scaling and translation parameters. Finally, face feature is extracted by principle component analysis. Experimental results on ORL and FERET face database show that the proposed method can get high face recognition rates.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128994448","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}
The confidential computation of matrix is a very important issue in secure multi-party computation. But there is no literature proposed truly multi-party confidential computation protocol on matrix factorization. In this paper, we use data perturbation assumptions and oblivious transfer protocol to construct a multi-party confidential computation protocol on matrix factorization which has high efficiency.
{"title":"Secure Multi-party Confidential Protocol of Matrix Factorization","authors":"Haiyan Xiao, Xiaoyuan Yang","doi":"10.1109/INCoS.2013.89","DOIUrl":"https://doi.org/10.1109/INCoS.2013.89","url":null,"abstract":"The confidential computation of matrix is a very important issue in secure multi-party computation. But there is no literature proposed truly multi-party confidential computation protocol on matrix factorization. In this paper, we use data perturbation assumptions and oblivious transfer protocol to construct a multi-party confidential computation protocol on matrix factorization which has high efficiency.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124462831","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}
The main problem that characterises the context of Special Education is the availability of a large amount of available information and its real, pertinent usability. The use of software systems for the semantic annotation and retrieval of teaching resources for this field appears to be still little explored, also due to the lack of specific semantic models for information description. This paper introduces the Knowledge Hub, a semantic repository of educational and information resources for Special Education, which is able to assist practitioners and teachers in finding the most interesting and useful digital resources for each special need by combining recommendation techniques with Semantic and Social Web models and tools. The paper also describes the encouraging results of a system experimentation with real users.
{"title":"A Social Semantic Repository for Special Needs Education","authors":"V. Benigno, N. Capuano, G. Mangione, S. Salerno","doi":"10.1109/INCoS.2013.48","DOIUrl":"https://doi.org/10.1109/INCoS.2013.48","url":null,"abstract":"The main problem that characterises the context of Special Education is the availability of a large amount of available information and its real, pertinent usability. The use of software systems for the semantic annotation and retrieval of teaching resources for this field appears to be still little explored, also due to the lack of specific semantic models for information description. This paper introduces the Knowledge Hub, a semantic repository of educational and information resources for Special Education, which is able to assist practitioners and teachers in finding the most interesting and useful digital resources for each special need by combining recommendation techniques with Semantic and Social Web models and tools. The paper also describes the encouraging results of a system experimentation with real users.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121232233","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}
Ximeng Liu, Jianfeng Ma, Jinbo Xiong, Qi Li, Jun Ma
In the cipher text-policy attribute based encryption scheme, the private key hold by user is associated with a set of attributes while the data is encrypted with an access structure defined by the data provider. In the most proposed schemes, the characteristics of attributes are treated in the identical level. In the real circumstance, the importance of each attributes is always different. In this paper, we propose a scheme called cipher text-policy weighted attribute based encryption (CP-WABE) while the attributes have different weights according to their importance. The CP-WABE scheme is proved to be security under the decision l-Expanded bilinear Diffie-Hellman exponent (l-Expanded BDHE) assumption, which can be considered as the generalization of traditional CP-ABE scheme when all attributes have equal weight.
{"title":"Ciphertext-Policy Weighted Attribute Based Encryption for Fine-Grained Access Control","authors":"Ximeng Liu, Jianfeng Ma, Jinbo Xiong, Qi Li, Jun Ma","doi":"10.1109/INCoS.2013.18","DOIUrl":"https://doi.org/10.1109/INCoS.2013.18","url":null,"abstract":"In the cipher text-policy attribute based encryption scheme, the private key hold by user is associated with a set of attributes while the data is encrypted with an access structure defined by the data provider. In the most proposed schemes, the characteristics of attributes are treated in the identical level. In the real circumstance, the importance of each attributes is always different. In this paper, we propose a scheme called cipher text-policy weighted attribute based encryption (CP-WABE) while the attributes have different weights according to their importance. The CP-WABE scheme is proved to be security under the decision l-Expanded bilinear Diffie-Hellman exponent (l-Expanded BDHE) assumption, which can be considered as the generalization of traditional CP-ABE scheme when all attributes have equal weight.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"403 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116508506","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}
There are two main approaches to achieve selective opening chosen-cipher text security (SO-CCA security): lossy encryption (including all-but-many lossy trapdoor functions) and sender-equivocable encryption. The second approach was proposed in Eurocrypt 2010 by Fehr et al., who proved that sender equivocability under chosen-cipher text attacks (NC-CCA security) implies SO-CCA security. They also proposed a new primitive called ``cross-authentication code'', and used it to construct a public-key encryption (PKE) scheme (the FHKW scheme) achieving NC-CCA security. However, recently in PKC 2013, Huang et al. pointed out that the properties of cross-authentication code cannot guarantee the NC-CCA security of the FHKW scheme, i.e., the security proof of the FHKW scheme is flawed. In this paper, we propose the notion of ``strong cross-authentication code'', which helps to fix the security proof of the FHKW scheme. This strong notion captures the ability of a cross-authentication code to efficiently generate a new key, based on all the other keys and the cross-authentication tag, such that the new key is statistically indistinguishable from the original key. With this code as a building block, we construct a new version of the FHKW scheme, and prove it to be NC-CCA secure for multi-bit plaintexts. Our work makes possible the instantiation of simulation-based SO-CCA secure PKE with a multi-bit message space from NC-CCA secure PKEs.
{"title":"Fixing the Sender-Equivocable Encryption Scheme in Eurocrypt 2010","authors":"Zhengan Huang, Shengli Liu, Baodong Qin, Kefei Chen","doi":"10.1109/INCoS.2013.69","DOIUrl":"https://doi.org/10.1109/INCoS.2013.69","url":null,"abstract":"There are two main approaches to achieve selective opening chosen-cipher text security (SO-CCA security): lossy encryption (including all-but-many lossy trapdoor functions) and sender-equivocable encryption. The second approach was proposed in Eurocrypt 2010 by Fehr et al., who proved that sender equivocability under chosen-cipher text attacks (NC-CCA security) implies SO-CCA security. They also proposed a new primitive called ``cross-authentication code'', and used it to construct a public-key encryption (PKE) scheme (the FHKW scheme) achieving NC-CCA security. However, recently in PKC 2013, Huang et al. pointed out that the properties of cross-authentication code cannot guarantee the NC-CCA security of the FHKW scheme, i.e., the security proof of the FHKW scheme is flawed. In this paper, we propose the notion of ``strong cross-authentication code'', which helps to fix the security proof of the FHKW scheme. This strong notion captures the ability of a cross-authentication code to efficiently generate a new key, based on all the other keys and the cross-authentication tag, such that the new key is statistically indistinguishable from the original key. With this code as a building block, we construct a new version of the FHKW scheme, and prove it to be NC-CCA secure for multi-bit plaintexts. Our work makes possible the instantiation of simulation-based SO-CCA secure PKE with a multi-bit message space from NC-CCA secure PKEs.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126139809","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}
Visualization is an important part of Network Analysis. It helps to find features of the network that are not easily identifiable. In this paper we present our approach to the visualization of weighted networks based on Sammon's projection. The network may be seen as a set of data points in the space induced by the incidence relation or as a symmetric matrix of vertex distances. We propose several methods for construction of the input for the Sammon's projection and discuss the effect of the particular methods on the final layout. Results are illustrated using several networks in the 2D layout. Presented experiments use the well-known Karate club network and weighted co-authors network based on the DBLP database.
{"title":"Network Layout Visualization Based on Sammon's Projection","authors":"M. Radvanský, M. Kudelka, Z. Horak, V. Snás̃el","doi":"10.1109/INCOS.2013.43","DOIUrl":"https://doi.org/10.1109/INCOS.2013.43","url":null,"abstract":"Visualization is an important part of Network Analysis. It helps to find features of the network that are not easily identifiable. In this paper we present our approach to the visualization of weighted networks based on Sammon's projection. The network may be seen as a set of data points in the space induced by the incidence relation or as a symmetric matrix of vertex distances. We propose several methods for construction of the input for the Sammon's projection and discuss the effect of the particular methods on the final layout. Results are illustrated using several networks in the 2D layout. Presented experiments use the well-known Karate club network and weighted co-authors network based on the DBLP database.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126103980","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}
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to optimize the network's topology, constructing a CDS for WSNs is a largely growing field, and a smaller CDS incurs less maintenance overhead. Research on finding smaller CDS is quite active. In this paper, a novel algorithm based on the Induced Tree of Crossed Cube is presented. It generates a CDS with a lower approximation radio. Our simulation shows that the algorithm provides the smallest CDS size comparing with some other traditional algorithms.
{"title":"Constructing Connected Dominating Set Based on Crossed Cube in WSN","authors":"Jing Zhang, Li Xu, Shuming Zhou, Wei Wu","doi":"10.1109/INCoS.2013.83","DOIUrl":"https://doi.org/10.1109/INCoS.2013.83","url":null,"abstract":"A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to optimize the network's topology, constructing a CDS for WSNs is a largely growing field, and a smaller CDS incurs less maintenance overhead. Research on finding smaller CDS is quite active. In this paper, a novel algorithm based on the Induced Tree of Crossed Cube is presented. It generates a CDS with a lower approximation radio. Our simulation shows that the algorithm provides the smallest CDS size comparing with some other traditional algorithms.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127144075","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}
In SCN12, Nieto et al. [7] discussed an interesting property of public key encryption with chosen cipher text security, that is, cipher texts with publicly verifiability. Independently, we introduced a new cryptographic primitive: CCA Secure Publicly verifiable Public Key Encryption Without Pairings In the Standard Model (PVPKE) and discussed its application in proxy re-encryption (PRE) and threshold public key encryption (TPKE)[10]. In Crypto'09, Hofheiz and Kiltz [6] introduced the group of signed quadratic residues and discussed its application, the most interesting feature of this group is its "gap" property, while the computational problem is as hard as factoring, and the corresponding decisional problem is easy. In this paper, we show that, if basing some of Nieto et al's schemes on signed quadratic residues, the resulting schemes can meet the requirements of PVPKE. Based on this observation, we give new constructions of PVPKE scheme based on signed quadratic residues and analysis its security.
在SCN12中，Nieto等人[7]讨论了具有选择密文安全性的公钥加密的一个有趣性质，即具有公开可验证性的密文。另外，我们引入了一种新的加密原语:CCA Secure Public verifiable Public Key Encryption Without pairs In the Standard Model (PVPKE)，并讨论了其在代理重加密(PRE)和阈值公钥加密(TPKE)中的应用[10]。在Crypto'09中，Hofheiz和Kiltz[6]引入了有符号二次残数群并讨论了它的应用，这个群最有趣的特征是它的“间隙”性质，而计算问题和因式分解一样难，对应的决策问题很容易。在本文中，我们证明了如果将Nieto等人的一些方案建立在有符号二次残基上，所得到的方案能够满足PVPKE的要求。在此基础上，给出了基于有符号二次残数的PVPKE方案的新构造，并分析了其安全性。
{"title":"New Construction of PVPKE Scheme Based on Signed Quadratic Residues","authors":"Jindan Zhang, Xu An Wang","doi":"10.1109/INCoS.2013.81","DOIUrl":"https://doi.org/10.1109/INCoS.2013.81","url":null,"abstract":"In SCN12, Nieto et al. [7] discussed an interesting property of public key encryption with chosen cipher text security, that is, cipher texts with publicly verifiability. Independently, we introduced a new cryptographic primitive: CCA Secure Publicly verifiable Public Key Encryption Without Pairings In the Standard Model (PVPKE) and discussed its application in proxy re-encryption (PRE) and threshold public key encryption (TPKE)[10]. In Crypto'09, Hofheiz and Kiltz [6] introduced the group of signed quadratic residues and discussed its application, the most interesting feature of this group is its \"gap\" property, while the computational problem is as hard as factoring, and the corresponding decisional problem is easy. In this paper, we show that, if basing some of Nieto et al's schemes on signed quadratic residues, the resulting schemes can meet the requirements of PVPKE. Based on this observation, we give new constructions of PVPKE scheme based on signed quadratic residues and analysis its security.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130592220","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}
The wide use of Microblog leads to an instant online community, and the research on the Microblog networks topological structure is meaningful for understanding the information dissemination mechanism. We studied the distributions and correlation of the users' followers, friends, and bidirectional friend numbers and the correlation among them. In order to study the topological structure features of Microblog, we collected data from Sina Weibo and made a real bidirectional connection network. Using complex network theory, we analyze the statistical properties of this network, demonstrate that it processes small world and scale-free features. Moreover, we analyze some topological structure metrics, such as degree distributions, node degree correlation, and clustering coefficient distributions. Through inspecting the statistical properties, we find that it is disassortative and has hierarchy structure. In addition, we find that the users' age distribution can be divided into two sections and that there will emerge a large degree node in various stages of network evolution, but user average degree with user age has a gradual upward trend. We propose a fitness-based model with node accelerated growth, and the simulation results show that our model can be better consistent with the real network.
{"title":"Empirical Analysis and Evolution Modeling of Network Topological Structure in Microblog","authors":"Weiguo Yuan, Yun Liu","doi":"10.1109/INCoS.2013.125","DOIUrl":"https://doi.org/10.1109/INCoS.2013.125","url":null,"abstract":"The wide use of Microblog leads to an instant online community, and the research on the Microblog networks topological structure is meaningful for understanding the information dissemination mechanism. We studied the distributions and correlation of the users' followers, friends, and bidirectional friend numbers and the correlation among them. In order to study the topological structure features of Microblog, we collected data from Sina Weibo and made a real bidirectional connection network. Using complex network theory, we analyze the statistical properties of this network, demonstrate that it processes small world and scale-free features. Moreover, we analyze some topological structure metrics, such as degree distributions, node degree correlation, and clustering coefficient distributions. Through inspecting the statistical properties, we find that it is disassortative and has hierarchy structure. In addition, we find that the users' age distribution can be divided into two sections and that there will emerge a large degree node in various stages of network evolution, but user average degree with user age has a gradual upward trend. We propose a fitness-based model with node accelerated growth, and the simulation results show that our model can be better consistent with the real network.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134039097","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
扫码关注我们
求助内容：
应助结果提醒方式：