Modular exponentiation as a basic operation is widely used in discrete-log based cryptographic protocols. Most research has been made for outsourcing exponentiation modular a prime, works for outsourcing composite modular exponentiation are rare. In this paper, we propose two new secure outsourcing protocols for verifiable composite modular exponentiation and batch composite modular exponentiations respectively. We analyze the security and complexity of the protocols. Ours are more efficient.
{"title":"Outsourcing of Verifiable Composite Modular Exponentiations","authors":"Jie Liu, Bo Yang, Zhiguo Du","doi":"10.1109/INCoS.2013.102","DOIUrl":"https://doi.org/10.1109/INCoS.2013.102","url":null,"abstract":"Modular exponentiation as a basic operation is widely used in discrete-log based cryptographic protocols. Most research has been made for outsourcing exponentiation modular a prime, works for outsourcing composite modular exponentiation are rare. In this paper, we propose two new secure outsourcing protocols for verifiable composite modular exponentiation and batch composite modular exponentiations respectively. We analyze the security and complexity of the protocols. Ours are more efficient.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"50 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":"122169619","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 presents a novel hybrid encryption scheme for scalable video coding based on h.264 standard. In the proposed scheme different domains of video are select to encrypt with different cipher algorithm according to the importance of data. These domains include intra-prediction mode, motion vector and residual data of base layer, and the data of the enhancement layer. LEX (Lead Extraction) algorithm is facilitated to encrypt base layer information. Encryption key of LEX is generated by using chaos cipher technology, the enhancement layer data is scrambled with random permutation algorithm based on chaotic system. Experiment show that our scheme can provide the computational efficiency, and higher security for h.264 SVC.
{"title":"A Hybrid Encryption Scheme for Scalable Video Coding Based on H.264","authors":"Jianlong Zhang, Xinbao Gao","doi":"10.1109/INCoS.2013.136","DOIUrl":"https://doi.org/10.1109/INCoS.2013.136","url":null,"abstract":"This paper presents a novel hybrid encryption scheme for scalable video coding based on h.264 standard. In the proposed scheme different domains of video are select to encrypt with different cipher algorithm according to the importance of data. These domains include intra-prediction mode, motion vector and residual data of base layer, and the data of the enhancement layer. LEX (Lead Extraction) algorithm is facilitated to encrypt base layer information. Encryption key of LEX is generated by using chaos cipher technology, the enhancement layer data is scrambled with random permutation algorithm based on chaotic system. Experiment show that our scheme can provide the computational efficiency, and higher security for h.264 SVC.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"27 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":"116872574","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 Cognitive radio networks (CRNs) the primary users(PUs) and secondary users(SUs) share the spectrum resource, which can be an effective solution to the problem that the existing network spectrum utilization is not high. Therefore, to correctly sense whether the spectrum is idle or not is an important prerequisite for spectrum sharing. Spectrum sensing requires the secondary users to cooperate in sensing and report the sensed data. Therefore the CRN is subject to sensed data tampering and primary user emulation. The trustiness of the SUs is, therefore, very important. In this paper, the trust management is introduced to solve the problem of the trustiness of the SUs. A method of trust threshold value judgment is proposed for selecting the trust threshold in trust management. And the threshold will be a standard of the trustiness of SUs. Market equilibrium in the market theory is adopted. The demand function and supply function are built to find the trust value at the market equilibrium point. With the Beta distribution, the ultimate threshold will be given so that it can ensure the fairness of the SUs.
{"title":"Dynamic Trust Threshold Value Based on Market Theory in Cognitive Radio Networks","authors":"Qingqi Pei, Conglin Wang, Zi Li","doi":"10.1109/INCoS.2013.99","DOIUrl":"https://doi.org/10.1109/INCoS.2013.99","url":null,"abstract":"In Cognitive radio networks (CRNs) the primary users(PUs) and secondary users(SUs) share the spectrum resource, which can be an effective solution to the problem that the existing network spectrum utilization is not high. Therefore, to correctly sense whether the spectrum is idle or not is an important prerequisite for spectrum sharing. Spectrum sensing requires the secondary users to cooperate in sensing and report the sensed data. Therefore the CRN is subject to sensed data tampering and primary user emulation. The trustiness of the SUs is, therefore, very important. In this paper, the trust management is introduced to solve the problem of the trustiness of the SUs. A method of trust threshold value judgment is proposed for selecting the trust threshold in trust management. And the threshold will be a standard of the trustiness of SUs. Market equilibrium in the market theory is adopted. The demand function and supply function are built to find the trust value at the market equilibrium point. With the Beta distribution, the ultimate threshold will be given so that it can ensure the fairness of the SUs.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"143 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":"122977831","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}
For double threshold energy detection of cooperative spectrum sensing in cognitive radio, which needs transfer much communication traffic and increases channel bandwidth and energy consumption of cognitive radio network, so an optimizational method is presented for the question in this paper. Depended on the detection probability of the network, while ensuring the performance of double threshold energy detection, the method search the best number of cognitive users participating cooperative detection to resolve the above question. Finally, the simulation results show the efficiency of this method.
{"title":"Research on Optimization for Cooperative Spectrum Sensing Based on Double Threshold Energy Detection","authors":"Huiqin Liu, Shubin Wang, Fei Li, Shaowen Zhan","doi":"10.1109/INCoS.2013.118","DOIUrl":"https://doi.org/10.1109/INCoS.2013.118","url":null,"abstract":"For double threshold energy detection of cooperative spectrum sensing in cognitive radio, which needs transfer much communication traffic and increases channel bandwidth and energy consumption of cognitive radio network, so an optimizational method is presented for the question in this paper. Depended on the detection probability of the network, while ensuring the performance of double threshold energy detection, the method search the best number of cognitive users participating cooperative detection to resolve the above question. Finally, the simulation results show the efficiency of this method.","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":"129687772","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}
Android is becoming more and more popular. Up to the first half of 2012, the Android phone market share has reached 52.5%. Only consider smart phone, the ratio is even more than 75%. Contacts is very important to users. Contacts synchronization system allows the user contacts can be stored on a network server. Users can process their data via multiple clients. And server can ensure consistency and security of users' data. Therefore, based on SyncML protocol we designed and implemented a contacts synchronization system for Android. Existing Android contacts sync software generally use separate synchronization protocol. They export all the contacts data into a file, and apply rsnyc algorithm to find the changes. In contrast, we provider a new way to find changes and use the SyncML to implemente the sync system.
{"title":"Design and Implementation of Android Contacts Synchronization System Based on the SyncML Protocol","authors":"Hao Yujie, Yan Chao","doi":"10.1109/INCOS.2013.131","DOIUrl":"https://doi.org/10.1109/INCOS.2013.131","url":null,"abstract":"Android is becoming more and more popular. Up to the first half of 2012, the Android phone market share has reached 52.5%. Only consider smart phone, the ratio is even more than 75%. Contacts is very important to users. Contacts synchronization system allows the user contacts can be stored on a network server. Users can process their data via multiple clients. And server can ensure consistency and security of users' data. Therefore, based on SyncML protocol we designed and implemented a contacts synchronization system for Android. Existing Android contacts sync software generally use separate synchronization protocol. They export all the contacts data into a file, and apply rsnyc algorithm to find the changes. In contrast, we provider a new way to find changes and use the SyncML to implemente the sync system.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"120 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":"128253564","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}
Yichuan Wang, Jianfeng Ma, D. Lu, Liumei Zhang, Xiang Lu
Security and efficiency of messages transmission are crucial requirements for multicast data origin authentication, especially in time-critical scenarios, such as pay-TV and the smart grid. However, how to balance such equirements is still a difficult issue. Through analysis, we find that TV-HORS is more suitable for the time-critical scenarios than RSA-based and MAC-based scheme. However, the reuse times of TV-HORS scheme is still too small to suit some scenarios. In this paper, we present a Game Model of Multicast Data Origin Authentication (GMMDOA), to describe the relationship between security and efficiency for the time-critical multicast communication, contra posing the TV-HORS scheme. By analyzing our model with Shannons information and game theory, we propose an optimization scheme for update the private key. Through the security analysis of our model, the signature valid time is negligible compared with the adversary attacking time. Thus, the security of our scheme is still secure even in the lowest risk-level parameter. We present measurement results from experiments and discuss performance comparisons. It shows that, our scheme does significantly to promote the efficiency of multicast data origin authentication.
{"title":"Game Optimization for Time-Critical Multicast Data Origin Authentication: Trade Off between Security and Efficiency","authors":"Yichuan Wang, Jianfeng Ma, D. Lu, Liumei Zhang, Xiang Lu","doi":"10.1109/INCoS.2013.51","DOIUrl":"https://doi.org/10.1109/INCoS.2013.51","url":null,"abstract":"Security and efficiency of messages transmission are crucial requirements for multicast data origin authentication, especially in time-critical scenarios, such as pay-TV and the smart grid. However, how to balance such equirements is still a difficult issue. Through analysis, we find that TV-HORS is more suitable for the time-critical scenarios than RSA-based and MAC-based scheme. However, the reuse times of TV-HORS scheme is still too small to suit some scenarios. In this paper, we present a Game Model of Multicast Data Origin Authentication (GMMDOA), to describe the relationship between security and efficiency for the time-critical multicast communication, contra posing the TV-HORS scheme. By analyzing our model with Shannons information and game theory, we propose an optimization scheme for update the private key. Through the security analysis of our model, the signature valid time is negligible compared with the adversary attacking time. Thus, the security of our scheme is still secure even in the lowest risk-level parameter. We present measurement results from experiments and discuss performance comparisons. It shows that, our scheme does significantly to promote the efficiency of multicast data origin authentication.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"23 1-2 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":"115990932","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}
Due to its simplicity and its easy comprehension, Jain's fairness index is still among the most popular measures to compare justness of allocations. However, it was already argued in the original paper that while the way of computing the index is well established, it is not immediately clear to which metric to apply the computation. Thereby, metric stands for a specific choice of a system observable. Here we study the extension of Jain's index to multiple metrics at once. We propose a set of per-entity allocation features to represent justness of an allocation, and to derive corresponding vectors of feature-wise taken Jain's fairness indices. The features give a numerical representation of fulfilling common fairness properties like proportionality, envy-freeness and equity of an allocation. Then, maximizing the smallest index gives an efficient procedure for allocation of goods. We study this procedure for the problem of allocating wireless channels in a multi-user setup and compare the influence of the various feature choices on the efficiency of the solution.
{"title":"Multi-Jain Fairness Index of Per-Entity Allocation Features for Fair and Efficient Allocation of Network Resources","authors":"M. Köppen, K. Ohnishi, M. Tsuru","doi":"10.1109/INCoS.2013.161","DOIUrl":"https://doi.org/10.1109/INCoS.2013.161","url":null,"abstract":"Due to its simplicity and its easy comprehension, Jain's fairness index is still among the most popular measures to compare justness of allocations. However, it was already argued in the original paper that while the way of computing the index is well established, it is not immediately clear to which metric to apply the computation. Thereby, metric stands for a specific choice of a system observable. Here we study the extension of Jain's index to multiple metrics at once. We propose a set of per-entity allocation features to represent justness of an allocation, and to derive corresponding vectors of feature-wise taken Jain's fairness indices. The features give a numerical representation of fulfilling common fairness properties like proportionality, envy-freeness and equity of an allocation. Then, maximizing the smallest index gives an efficient procedure for allocation of goods. We study this procedure for the problem of allocating wireless channels in a multi-user setup and compare the influence of the various feature choices on the efficiency of the solution.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"21 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":"125686319","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 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}
In recent years, China's catering industry competition fierce increasingly, which dramatically accelerated the rapid evolution of the industry ecosystem and business development model. Reality, catering industry supply chain management services are moving towards specialization and diversification. However, there still confront many problems in the corporate positioning, selection of the operating and external business. First, starting from the definition of the catering industry supply chain ecosystem, this paper analyzes the different actors in the supply chain ecosystem. We discussed the process and characteristics of the supply chain in catering industry supply chain secondly. Then, the related evaluation model which impress on mathematical model is established between the catering industry supply chain service providers and customers.
{"title":"Creation of Customer Evaluation Model in the Catering Industry Supply Chain Ecosystem","authors":"Kai Wei, J. Gou, Rui Chai, W. Dai","doi":"10.1109/INCoS.2013.144","DOIUrl":"https://doi.org/10.1109/INCoS.2013.144","url":null,"abstract":"In recent years, China's catering industry competition fierce increasingly, which dramatically accelerated the rapid evolution of the industry ecosystem and business development model. Reality, catering industry supply chain management services are moving towards specialization and diversification. However, there still confront many problems in the corporate positioning, selection of the operating and external business. First, starting from the definition of the catering industry supply chain ecosystem, this paper analyzes the different actors in the supply chain ecosystem. We discussed the process and characteristics of the supply chain in catering industry supply chain secondly. Then, the related evaluation model which impress on mathematical model is established between the catering industry supply chain service providers and customers.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"31 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":"132764425","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
扫码关注我们
求助内容：
应助结果提醒方式：