In an identity based cryptosystem, a user's identity is used as its public key. So, a digital certificate is no longer needed for the authenticity of a public key. However, a necessary problem arises: how to prove that a user is revoked or non-revoked? The ideal revocation mechanism is to update every user's private key at every time period by the private key generater (PKG). Most of the existing works are revocable identity based encryption. In this paper, we present a revocable identity based signature scheme, which is more efficient than previous solutions. In our scheme, a user's private key is composed of both an initial private key and a time key. The time key is periodically updated by PKG, and is transmitted over a public channel. In addition, the new scheme does not use the expensive bilinear pairings. Formal security proofs are provided in the random oracle model under the standard Discrete Logarithm assumption. We also extend the new scheme to be decryption-key-exposure resilient.
{"title":"Revocable Identity-Based Signature without Pairing","authors":"Yinxia Sun, Futai Zhang, Limin Shen, R. Deng","doi":"10.1109/INCoS.2013.68","DOIUrl":"https://doi.org/10.1109/INCoS.2013.68","url":null,"abstract":"In an identity based cryptosystem, a user's identity is used as its public key. So, a digital certificate is no longer needed for the authenticity of a public key. However, a necessary problem arises: how to prove that a user is revoked or non-revoked? The ideal revocation mechanism is to update every user's private key at every time period by the private key generater (PKG). Most of the existing works are revocable identity based encryption. In this paper, we present a revocable identity based signature scheme, which is more efficient than previous solutions. In our scheme, a user's private key is composed of both an initial private key and a time key. The time key is periodically updated by PKG, and is transmitted over a public channel. In addition, the new scheme does not use the expensive bilinear pairings. Formal security proofs are provided in the random oracle model under the standard Discrete Logarithm assumption. We also extend the new scheme to be decryption-key-exposure resilient.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"135 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":"127349216","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}
Zenghui Zhao, Jingnong Weng, Huaizhou Wang, Junyi Zhao, Jingui Li, Anda Li
Digital Earth has the extraordinary ability of integrating multi-source, heterogeneous, multi-scale spatial and temporal information with three dimensional, dynamic and interactive features and provides abundant visualization methods of temporal analysis and statistics. A kind of novel applications were developed based on Three-dimensional Digital Earth Application Development Framework, namely WikiGlobe ADF. It provides a new perspective for people understand and discover various kinds of knowledge about our living planet. These applications can be widely used in fields of education, humanity, history and tourism. Their properties of user participation and lightweight can satisfy the needs of developing personalized thematic applications and provide a well-interactive platform of spatial information service for the public. In this paper, the application characters and current trends of digital earth was analyzed, and architecture of WikiGlobe ADF was described then, the features and the realization mechanism of the framework were discussed. Based on the work above, several examples developed through the WikiGlobe ADF were presented.
{"title":"On Three-Dimensional Digital Earth Application Development Framework and Its Applications","authors":"Zenghui Zhao, Jingnong Weng, Huaizhou Wang, Junyi Zhao, Jingui Li, Anda Li","doi":"10.1109/INCoS.2013.147","DOIUrl":"https://doi.org/10.1109/INCoS.2013.147","url":null,"abstract":"Digital Earth has the extraordinary ability of integrating multi-source, heterogeneous, multi-scale spatial and temporal information with three dimensional, dynamic and interactive features and provides abundant visualization methods of temporal analysis and statistics. A kind of novel applications were developed based on Three-dimensional Digital Earth Application Development Framework, namely WikiGlobe ADF. It provides a new perspective for people understand and discover various kinds of knowledge about our living planet. These applications can be widely used in fields of education, humanity, history and tourism. Their properties of user participation and lightweight can satisfy the needs of developing personalized thematic applications and provide a well-interactive platform of spatial information service for the public. In this paper, the application characters and current trends of digital earth was analyzed, and architecture of WikiGlobe ADF was described then, the features and the realization mechanism of the framework were discussed. Based on the work above, several examples developed through the WikiGlobe ADF were presented.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"28 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":"126583485","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}
Virtual Segment (VS) is an architecture design for delay tolerant network to efficiently perform the store-carry-and-forward routing along traffic flows of vehicles on roadway networks. VS network consists of three types of node: Corresponding Node (CN), Relay Node (RN), and Base Node (BN). CN is a stationary node as the roles of a sender and a receiver of messages, RN is a movable node as a vehicle to relay the messages, and BN is a stationary gateway to the core backbone network connecting all the BNs as a reliable high-speed communication network. The VS network is considered to be effective for message forwarding in disaster situations since RNs are flexible to transfer messages between CNs and BNs. However, effects of breakdown of BNs by disaster have not been well studied even though the failure of message transfer between BNs seriously degrade the performance of the arrival rate of forwarding messages. In this paper, we investigate some disaster scenarios using our traffic simulator of vehicles and also our mathematical model of the VS network to simulate the effects of the disruption of BNs on the performance. We consider some methods to determine the restoration order of broken BNs and numerically compare the performance of the arrival rate. As a result, we found that the performance of the arrival rate is quickly recovered by the preferential restoration of frequently used BNs.
{"title":"Methods for Determining the Restoration Order of Base Nodes in the Virtual Segment Network","authors":"H. Tsuji, A. Fujihara, H. Miwa","doi":"10.1109/INCoS.2013.85","DOIUrl":"https://doi.org/10.1109/INCoS.2013.85","url":null,"abstract":"Virtual Segment (VS) is an architecture design for delay tolerant network to efficiently perform the store-carry-and-forward routing along traffic flows of vehicles on roadway networks. VS network consists of three types of node: Corresponding Node (CN), Relay Node (RN), and Base Node (BN). CN is a stationary node as the roles of a sender and a receiver of messages, RN is a movable node as a vehicle to relay the messages, and BN is a stationary gateway to the core backbone network connecting all the BNs as a reliable high-speed communication network. The VS network is considered to be effective for message forwarding in disaster situations since RNs are flexible to transfer messages between CNs and BNs. However, effects of breakdown of BNs by disaster have not been well studied even though the failure of message transfer between BNs seriously degrade the performance of the arrival rate of forwarding messages. In this paper, we investigate some disaster scenarios using our traffic simulator of vehicles and also our mathematical model of the VS network to simulate the effects of the disruption of BNs on the performance. We consider some methods to determine the restoration order of broken BNs and numerically compare the performance of the arrival rate. As a result, we found that the performance of the arrival rate is quickly recovered by the preferential restoration of frequently used BNs.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"89 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":"127892096","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}
To deploy Map-Reduce as a data processing service over cloud computing, we must provide necessary security mechanisms to protect customers confidential data processed. In this paper, we present Map-Reduce based framework which provides strong security and privacy guarantees for distributed computations on sensitive data. The framework is a novel integration of access control via attribute-based encryption, and privacy-preserving aggregate computation via homomorphic encryption. Data providers control the security policy for their sensitive data. Users without security expertise can perform computations on the data, but the framework confines these computations, preventing information leakage beyond the data provider's policy. Our prototype implementation demonstrates the flexibility of the framework on several case studies. It was proved more efficient than fully homomorphic encryption.
{"title":"Design of a Security Framework on MapReduce","authors":"Zhen Guo, Xudong Zhu, Lijun Guo, S. Kang","doi":"10.1109/INCoS.2013.29","DOIUrl":"https://doi.org/10.1109/INCoS.2013.29","url":null,"abstract":"To deploy Map-Reduce as a data processing service over cloud computing, we must provide necessary security mechanisms to protect customers confidential data processed. In this paper, we present Map-Reduce based framework which provides strong security and privacy guarantees for distributed computations on sensitive data. The framework is a novel integration of access control via attribute-based encryption, and privacy-preserving aggregate computation via homomorphic encryption. Data providers control the security policy for their sensitive data. Users without security expertise can perform computations on the data, but the framework confines these computations, preventing information leakage beyond the data provider's policy. Our prototype implementation demonstrates the flexibility of the framework on several case studies. It was proved more efficient than fully homomorphic encryption.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"30 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":"121180954","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-receiver signcrption is useful in many applications such as secure email systems. In this paper, we propose a new efficient construction of multi-receiver signcryption from identity-based public key cryptosystem to traditional public key cryptosystem. The new scheme enables a user in IDPKC successfully broadcast messages, not only in authentic way but also in privately way, to users in TPKC. Furthermore, the security proof shows the proposed scheme is secure under the hardness of Generalized Bilinear Diffie-Hellman Problem in the random oracle.
{"title":"IDPKC-to-TPKC Construction of Multi-receiver Signcryption","authors":"Xiaotong Fu, Xiaowei Li, Wen Liu","doi":"10.1109/INCoS.2013.62","DOIUrl":"https://doi.org/10.1109/INCoS.2013.62","url":null,"abstract":"Multi-receiver signcrption is useful in many applications such as secure email systems. In this paper, we propose a new efficient construction of multi-receiver signcryption from identity-based public key cryptosystem to traditional public key cryptosystem. The new scheme enables a user in IDPKC successfully broadcast messages, not only in authentic way but also in privately way, to users in TPKC. Furthermore, the security proof shows the proposed scheme is secure under the hardness of Generalized Bilinear Diffie-Hellman Problem in the random oracle.","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":"116699818","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}
Along with anonymous communications system being widely researched, anonymity measurement becomes more and more significant. However, there is still no desired mathematical model for this. In this paper, some necessary features for anonymity measurement model are analyzed and a dynamic model based on information entropy is proposed. Then some analyses, as well as the practicality of our model illustrated with some examples are given. Finally, comparisons with other models are made to show advantages of our model.
{"title":"Information Entropy Model for Anonymity Measurement","authors":"Jun Ye, Yong Ding, Xin-Guo Li","doi":"10.1109/INCoS.2013.58","DOIUrl":"https://doi.org/10.1109/INCoS.2013.58","url":null,"abstract":"Along with anonymous communications system being widely researched, anonymity measurement becomes more and more significant. However, there is still no desired mathematical model for this. In this paper, some necessary features for anonymity measurement model are analyzed and a dynamic model based on information entropy is proposed. Then some analyses, as well as the practicality of our model illustrated with some examples are given. Finally, comparisons with other models are made to show advantages of our model.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"2010 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":"125609456","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}
Agent applications are often viewed as unduly expensive to develop and maintain in commercial contexts. Organizations often settle for less sophisticated and more traditional software in place of agent technology because of (often misplaced) fears about the development and maintenance costs of agent technology, and the often mistaken perception that traditional software offers better returns on investment. This paper aims to redress this by developing a plan recognition framework for agent program learning, where behavior logs of legacy applications (or even manually executed processes) are mined to extract a 'draft' version of agent code that could eventually replace these applications or processes. We develop and implement techniques for inferring agent plans, specifically inferring agent goals. We propose two ways to infer goals for plans without and with a goal library respectively. Besides, a preferred goal is considered when a goal library is provided, using the notions of consistency, maximal entailment and minimality. The complexity of the plan recognition framework is analyzed and the experimental results show that the average runtime for generating Belief-Desire-Intention (BDI) plans relying on the number of expansion nodes, choice branching factor and parallel branching factor in workflow nets (WF-nets), and that the plan recognition framework is feasible and computable.
{"title":"BDI Goal Recognition for Agent Program Learning","authors":"Hongyun Xu, Youqun Shi, Qiying Cao","doi":"10.1109/INCoS.2013.72","DOIUrl":"https://doi.org/10.1109/INCoS.2013.72","url":null,"abstract":"Agent applications are often viewed as unduly expensive to develop and maintain in commercial contexts. Organizations often settle for less sophisticated and more traditional software in place of agent technology because of (often misplaced) fears about the development and maintenance costs of agent technology, and the often mistaken perception that traditional software offers better returns on investment. This paper aims to redress this by developing a plan recognition framework for agent program learning, where behavior logs of legacy applications (or even manually executed processes) are mined to extract a 'draft' version of agent code that could eventually replace these applications or processes. We develop and implement techniques for inferring agent plans, specifically inferring agent goals. We propose two ways to infer goals for plans without and with a goal library respectively. Besides, a preferred goal is considered when a goal library is provided, using the notions of consistency, maximal entailment and minimality. The complexity of the plan recognition framework is analyzed and the experimental results show that the average runtime for generating Belief-Desire-Intention (BDI) plans relying on the number of expansion nodes, choice branching factor and parallel branching factor in workflow nets (WF-nets), and that the plan recognition framework is feasible and computable.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"8 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":"127722413","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}
This paper proposes a novel encoding procedure to realize codes that resemble SR-LDPC codes (rate less codes for erasure correction). For the case of two sources communicating with a single destination via a common relay, the two sources separately encode their own symbols of information using SR-LDPC codes. The two code words are then XOR-ed at the relay. The destination can recover the information from the two sources.
{"title":"Distributed SR-LDPC Codes over Multiple-Access Relay Channel","authors":"Rong Sun, Jingwei Liu","doi":"10.1109/INCoS.2013.117","DOIUrl":"https://doi.org/10.1109/INCoS.2013.117","url":null,"abstract":"This paper proposes a novel encoding procedure to realize codes that resemble SR-LDPC codes (rate less codes for erasure correction). For the case of two sources communicating with a single destination via a common relay, the two sources separately encode their own symbols of information using SR-LDPC codes. The two code words are then XOR-ed at the relay. The destination can recover the information from the two sources.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"78 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":"122776673","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}
Many natural networks including social networks are scale-free, i.e. the distribution of node degrees in the network is heavy-tailed and follows the power law. In this work we analyze the scale-free properties of selected subnets of a complex co-authorship network induced by significant nodes (authors) and the evolution of these properties in time. The subnets induced by significant authors are sampled at different times and the power law parameters are estimated analytically. The study provides an empirical overview of the scale-freeness and evolution of power law parameters in a dynamic co-authorship network.
{"title":"Evolution of Scale-Freeness in a Co-authorship Network","authors":"P. Krömer, M. Kudelka, Z. Horak, V. Snás̃el","doi":"10.1109/INCoS.2013.127","DOIUrl":"https://doi.org/10.1109/INCoS.2013.127","url":null,"abstract":"Many natural networks including social networks are scale-free, i.e. the distribution of node degrees in the network is heavy-tailed and follows the power law. In this work we analyze the scale-free properties of selected subnets of a complex co-authorship network induced by significant nodes (authors) and the evolution of these properties in time. The subnets induced by significant authors are sampled at different times and the power law parameters are estimated analytically. The study provides an empirical overview of the scale-freeness and evolution of power law parameters in a dynamic co-authorship network.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"29 5 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":"125096886","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}
Cloud Computing moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. In this work, we study the problem of ensuring the integrity of data storage in Cloud Computing. To reduce the computational cost at user side during the integrity verification of their data, the notion of public verifiability has been proposed. However, the challenge is that the computational burden is too huge for the users to compute the public authentication tags of file blocks. To tackle the challenge, we propose a new cloud storage architecture with two independent cloud servers, that is, the cloud storage server and the cloud audit server, where the latter is assumed to be semi-honest. In particular, we consider the task of allowing the cloud audit server, on behalf of the cloud users, to pre-process the data before uploading to the cloud storage server and later verifying the data integrity. The introduction of cloud audit server eliminates the involvement of user in the auditing and in the pre-processing phases.
{"title":"An Efficient Proof of Retrievability with Public Auditing in Cloud Computing","authors":"Jin Li, Xiao Tan, Xiaofeng Chen, D. Wong","doi":"10.1109/INCoS.2013.185","DOIUrl":"https://doi.org/10.1109/INCoS.2013.185","url":null,"abstract":"Cloud Computing moves the application software and databases to the centralized large data centers, where the management of the data and services may not be fully trustworthy. In this work, we study the problem of ensuring the integrity of data storage in Cloud Computing. To reduce the computational cost at user side during the integrity verification of their data, the notion of public verifiability has been proposed. However, the challenge is that the computational burden is too huge for the users to compute the public authentication tags of file blocks. To tackle the challenge, we propose a new cloud storage architecture with two independent cloud servers, that is, the cloud storage server and the cloud audit server, where the latter is assumed to be semi-honest. In particular, we consider the task of allowing the cloud audit server, on behalf of the cloud users, to pre-process the data before uploading to the cloud storage server and later verifying the data integrity. The introduction of cloud audit server eliminates the involvement of user in the auditing and in the pre-processing phases.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"20 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":"122121161","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
扫码关注我们
求助内容：
应助结果提醒方式：