The context-aware calculation method is applied to the model of recommendation system in this paper. Based on context of scenario analysis and inference, we can implement recommendation for user group. This paper makes use of the context of scenarios aware technology, which fuses multi-source data from smart phones, sensor networks and social networks for the scenario modeling and inference, and then formats the context clues to build the perceptual model of the context scenarios to predict the behavior patterns of the user group for the group recommendation, which meet the needs of the user group. We have analyzed the recommendation process and performed a subjective test to show the usefulness of the proposed system.
{"title":"The Contextual Group Recommendation","authors":"Jing Wang, Hui Li, H Zhao","doi":"10.1109/INCoS.2013.27","DOIUrl":"https://doi.org/10.1109/INCoS.2013.27","url":null,"abstract":"The context-aware calculation method is applied to the model of recommendation system in this paper. Based on context of scenario analysis and inference, we can implement recommendation for user group. This paper makes use of the context of scenarios aware technology, which fuses multi-source data from smart phones, sensor networks and social networks for the scenario modeling and inference, and then formats the context clues to build the perceptual model of the context scenarios to predict the behavior patterns of the user group for the group recommendation, which meet the needs of the user group. We have analyzed the recommendation process and performed a subjective test to show the usefulness of the proposed system.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"11 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":"134283026","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 basic algorithm used in pairing computation was first described by Miller and this algorithm can be named double-and-add and line-and-tangle algorithm. We will describe, in detail sufficient, a variant of Miller's which will replace double-and-add method with Montgomery ladder method. In order to achieve better efficiency, parallel method will be used. We observe that, in many practical settings, affine coordinate are faster than projective coordinate in Miller algorithm. Therefore, we mainly discuss situations in affine coordinate. In affine coordinate, the cost comparison of our algorithm with previously basic algorithms shows an efficiency improvement of around 30% in general elliptic curves.
结对计算中使用的基本算法是由Miller首先描述的，该算法可命名为double and add和line and tangle算法。我们将充分详细地描述米勒的一种变体，它将用蒙哥马利阶梯法取代双加法。为了获得更好的效率，将采用并行方法。我们观察到，在许多实际设置中，仿射坐标比射影坐标在Miller算法中更快。因此，我们主要讨论仿射坐标下的情形。在仿射坐标下，我们的算法与以前的基本算法的成本比较表明，在一般椭圆曲线上，我们的算法的效率提高了30%左右。
{"title":"Efficient Implementation of Tate Pairing with Montgomery Ladder Method","authors":"Yulong Tian, Dawu Gu, Haihua Gu","doi":"10.1109/INCoS.2013.75","DOIUrl":"https://doi.org/10.1109/INCoS.2013.75","url":null,"abstract":"The basic algorithm used in pairing computation was first described by Miller and this algorithm can be named double-and-add and line-and-tangle algorithm. We will describe, in detail sufficient, a variant of Miller's which will replace double-and-add method with Montgomery ladder method. In order to achieve better efficiency, parallel method will be used. We observe that, in many practical settings, affine coordinate are faster than projective coordinate in Miller algorithm. Therefore, we mainly discuss situations in affine coordinate. In affine coordinate, the cost comparison of our algorithm with previously basic algorithms shows an efficiency improvement of around 30% in general elliptic curves.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"38 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":"132743773","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, Tao Zhang, Jianfeng Ma, Hui Zhu, Feng Cai
Attribute based signature scheme is an important cryptographic primitive providing a powerful way for user to control their privacy. In wireless environment, the capacity of wireless channel is valuable resources which is limited. More information can be transmitted through the wireless channel when the cost of using signature to verify the message become less. In order to reduce the bandwidth needed to transmit attribute based signatures and keep signer's privacy, attribute based multi-signature scheme(ABMS) was proposed in this paper. Moveover, We formalized and constructed the ABMS. Our scheme is existentially unforgeable against chosen message attack and on Computational Diffie-Hellman(CDH) problem in the standard model. Analysis shows that our ABMS is more appropriate for wireless network to guarantee integrity of the data.
{"title":"Efficient Data Integrity Verification Using Attribute Based Multi-signature Scheme in Wireless Network","authors":"Ximeng Liu, Tao Zhang, Jianfeng Ma, Hui Zhu, Feng Cai","doi":"10.1109/INCoS.2013.34","DOIUrl":"https://doi.org/10.1109/INCoS.2013.34","url":null,"abstract":"Attribute based signature scheme is an important cryptographic primitive providing a powerful way for user to control their privacy. In wireless environment, the capacity of wireless channel is valuable resources which is limited. More information can be transmitted through the wireless channel when the cost of using signature to verify the message become less. In order to reduce the bandwidth needed to transmit attribute based signatures and keep signer's privacy, attribute based multi-signature scheme(ABMS) was proposed in this paper. Moveover, We formalized and constructed the ABMS. Our scheme is existentially unforgeable against chosen message attack and on Computational Diffie-Hellman(CDH) problem in the standard model. Analysis shows that our ABMS is more appropriate for wireless network to guarantee integrity of the data.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"4 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":"130789534","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}
Image segmentation is a fundamental task in automatic image analysis. However, there is still no generally accepted effectiveness measure which is suitable for evaluating the segmentation quality in every application. In this paper, we propose an evaluation framework which benefits from multiple stand-alone measures. To this end, different segmentation evaluation measures are chosen to evaluate segmentation separately, and the results are effectively combined using machine learning methods. We train and implement this framework in the segmentation dataset which contains images of different contents with segmentation ground truth produced by human. In addition, we provide human evaluation of image segmentation pairs to benchmark the evaluation results of the measures. Experimental results show a better performance than the stand-alone methods.
{"title":"A Learning-Based Framework for Image Segmentation Evaluation","authors":"Jian Lin, Bo Peng, Tianrui Li, Qin Chen","doi":"10.1109/INCoS.2013.133","DOIUrl":"https://doi.org/10.1109/INCoS.2013.133","url":null,"abstract":"Image segmentation is a fundamental task in automatic image analysis. However, there is still no generally accepted effectiveness measure which is suitable for evaluating the segmentation quality in every application. In this paper, we propose an evaluation framework which benefits from multiple stand-alone measures. To this end, different segmentation evaluation measures are chosen to evaluate segmentation separately, and the results are effectively combined using machine learning methods. We train and implement this framework in the segmentation dataset which contains images of different contents with segmentation ground truth produced by human. In addition, we provide human evaluation of image segmentation pairs to benchmark the evaluation results of the measures. Experimental results show a better performance than the stand-alone methods.","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":"131006330","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}
P2P technologies have been considered as one of the most disruptive Internet technologies in achieving fully decentralized and efficient communication in distributed systems. Indeed, the nature of the direct communication among peers in the system, being these machines or people, makes possible to overcome the limitations of the flat communications through email, newsgroups and other forum-based communication forms. In fact, the usefulness of P2P paradigm has been shown not only in the development of stand alone P2P applications, but also in using its features in other Internet-based systems and paradigms such as Mobile Adhoc Networks (MANETs), Groupware systems, Mobile teamwork and in a broader sense in distributed systems that need coordination, replication, awareness and synchronization. In this paper we analyse the use of the P2P technologies in collaborative teamwork with a special emphasis on the mobile collaborative teams. A mobile team is a group of people that are geographically distributed and collaborate together work for the accomplishment of a project. Mobile teamwork has become an important paradigm of the today workforce especially in Small and Medium size Enterprises to cover many fields such as field work, journalism, online collaborative learning, disaster management scenarios and businesses. As a result of our analysis, we show how P2P technology as well as the core P2P functions and protocols can enhance the collaborative teamwork of various forms, including mobile teamwork.
{"title":"Analysis of P2P Communications in Online Collaborative Teamwork Settings","authors":"Vladi Koliçi, F. Xhafa, L. Barolli","doi":"10.1109/INCOS.2013.163","DOIUrl":"https://doi.org/10.1109/INCOS.2013.163","url":null,"abstract":"P2P technologies have been considered as one of the most disruptive Internet technologies in achieving fully decentralized and efficient communication in distributed systems. Indeed, the nature of the direct communication among peers in the system, being these machines or people, makes possible to overcome the limitations of the flat communications through email, newsgroups and other forum-based communication forms. In fact, the usefulness of P2P paradigm has been shown not only in the development of stand alone P2P applications, but also in using its features in other Internet-based systems and paradigms such as Mobile Adhoc Networks (MANETs), Groupware systems, Mobile teamwork and in a broader sense in distributed systems that need coordination, replication, awareness and synchronization. In this paper we analyse the use of the P2P technologies in collaborative teamwork with a special emphasis on the mobile collaborative teams. A mobile team is a group of people that are geographically distributed and collaborate together work for the accomplishment of a project. Mobile teamwork has become an important paradigm of the today workforce especially in Small and Medium size Enterprises to cover many fields such as field work, journalism, online collaborative learning, disaster management scenarios and businesses. As a result of our analysis, we show how P2P technology as well as the core P2P functions and protocols can enhance the collaborative teamwork of various forms, including mobile teamwork.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"52 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":"121552832","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}
Based signatures (ABS for short) allow an entity to sign messages with a fine-grained control over identity information. The signature attests not to the identity of the individual who endorsed a message, but instead to a claim regarding the attributes he/she holds. ABS has been well investigated since its introduction but little has been done on the revocation in ABS. In this paper, we divide ABS revocation as fine-grained attribute-revocation and coarse-grained user-revocation. The latter is the focus of this paper, and we present a concrete design-to address the issue of coarse-grained user-revocation in ABS without the need of any other third parties.
{"title":"Attribute-Based Signatures with Efficient Revocation","authors":"Yanling Lian, Li Xu, Xinyi Huang","doi":"10.1109/INCoS.2013.106","DOIUrl":"https://doi.org/10.1109/INCoS.2013.106","url":null,"abstract":"Based signatures (ABS for short) allow an entity to sign messages with a fine-grained control over identity information. The signature attests not to the identity of the individual who endorsed a message, but instead to a claim regarding the attributes he/she holds. ABS has been well investigated since its introduction but little has been done on the revocation in ABS. In this paper, we divide ABS revocation as fine-grained attribute-revocation and coarse-grained user-revocation. The latter is the focus of this paper, and we present a concrete design-to address the issue of coarse-grained user-revocation in ABS without the need of any other third parties.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"14 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":"114636013","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 certificateless strong designated verifier signature (CL-SDVS) may provide more convenient deployment than other SDVS schemes since user's public keys can be published freely and no key-escrow problem needed to be worried about. However, there are only several CL-SDVS schemes and their security is doubtable. This paper provides general CL-SDVS schemes and instances, and discusses their security briefly.
{"title":"General Certificateless Strong Designated Verifier Signature Schemes","authors":"Haibo Tian","doi":"10.1109/INCoS.2013.74","DOIUrl":"https://doi.org/10.1109/INCoS.2013.74","url":null,"abstract":"A certificateless strong designated verifier signature (CL-SDVS) may provide more convenient deployment than other SDVS schemes since user's public keys can be published freely and no key-escrow problem needed to be worried about. However, there are only several CL-SDVS schemes and their security is doubtable. This paper provides general CL-SDVS schemes and instances, and discusses their security briefly.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"11 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":"115140786","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}
Several results of secure obfuscation for particular function families have been raised out in despite of the general impossibility result presented by Barak et al. A special re-encryption function was securely obfuscated by Hohenberger et al. in TCC'07. The re-encryption function constructed by them has particular property that the second level cipher texts are in different form with the first level cipher texts, so the second level cipher texts cannot be re-encrypted for multi-use. Besides, decryption of the second level cipher texts need to be fulfilled by brute force search on the message space. In this paper we propose a new re-encryption function which can be securely obfuscated and supports multi-use transfer. Moreover, the decryption of the second level cipher texts does not need brute force search. Besides, we extend this re-encryption function to a conditional re-encryption with keyword search scheme, which only transfers those first level cipher texts satisfying some keyword condition to the second level cipher texts. Also we give out the obfuscation of the function family and the security analysis.
{"title":"Secure Obfuscation of Conditional Re-encryption with Keyword Search","authors":"Rong Cheng, Fangguo Zhang","doi":"10.1109/INCoS.2013.15","DOIUrl":"https://doi.org/10.1109/INCoS.2013.15","url":null,"abstract":"Several results of secure obfuscation for particular function families have been raised out in despite of the general impossibility result presented by Barak et al. A special re-encryption function was securely obfuscated by Hohenberger et al. in TCC'07. The re-encryption function constructed by them has particular property that the second level cipher texts are in different form with the first level cipher texts, so the second level cipher texts cannot be re-encrypted for multi-use. Besides, decryption of the second level cipher texts need to be fulfilled by brute force search on the message space. In this paper we propose a new re-encryption function which can be securely obfuscated and supports multi-use transfer. Moreover, the decryption of the second level cipher texts does not need brute force search. Besides, we extend this re-encryption function to a conditional re-encryption with keyword search scheme, which only transfers those first level cipher texts satisfying some keyword condition to the second level cipher texts. Also we give out the obfuscation of the function family and the security analysis.","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":"124569383","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}
We presented a pedestrian classification method based on improved support vector machine in order to solve non-rigid objects are difficult to identify in intelligent monitoring system. The video activity in the prospect is represented by a series of spatio-temporal interest point. Since human posture has the characteristics of uncertainty and illegibility, the clustering centers of each class are computed by fuzzy clustering technique. Then a full-SVM decision tree is constructed based on conventional decision tree. At last, the method is evaluated on the Weizmann action dataset and received comparative high correct recognition rate.
{"title":"Pedestrian Classification Based on Improved Support Vector Machines","authors":"Hongmin Xue, Zhijing Liu","doi":"10.1109/INCoS.2013.140","DOIUrl":"https://doi.org/10.1109/INCoS.2013.140","url":null,"abstract":"We presented a pedestrian classification method based on improved support vector machine in order to solve non-rigid objects are difficult to identify in intelligent monitoring system. The video activity in the prospect is represented by a series of spatio-temporal interest point. Since human posture has the characteristics of uncertainty and illegibility, the clustering centers of each class are computed by fuzzy clustering technique. Then a full-SVM decision tree is constructed based on conventional decision tree. At last, the method is evaluated on the Weizmann action dataset and received comparative high correct recognition rate.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"34 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":"115354570","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}
Jinbo Xiong, Zhiqiang Yao, Jianfeng Ma, Ximeng Liu, Qi Li
With the rapid emerging of the novelty Web services and cloud services, it becomes more and more easily to expose a user's sensitive documents into the cloud. In this paper, we combine identity-based encryption (IBE) algorithm with distributed hash table (DHT) network and propose an IBE-based secure document self-destruction (ISDS) scheme to protect the privacy security of past, archived sensitive documents, and make sure that all copies of those documents become unreadable by making them utomatically destructed after a predefined time without any human intervention. Comprehensive analysis shows that the ISDS scheme is able to resist not only traditional cryptanalysis and brute-force attack, but also Sybil attacks (e.g., hopping attack and sniffer attack) in the DHT network. More significantly, our ISDS scheme can also provide fine-grained access control during the lifetime of the sensitive documents, which is not guaranteed in other existing schemes.
{"title":"A Secure Document Self-Destruction Scheme with Identity Based Encryption","authors":"Jinbo Xiong, Zhiqiang Yao, Jianfeng Ma, Ximeng Liu, Qi Li","doi":"10.1109/INCoS.2013.42","DOIUrl":"https://doi.org/10.1109/INCoS.2013.42","url":null,"abstract":"With the rapid emerging of the novelty Web services and cloud services, it becomes more and more easily to expose a user's sensitive documents into the cloud. In this paper, we combine identity-based encryption (IBE) algorithm with distributed hash table (DHT) network and propose an IBE-based secure document self-destruction (ISDS) scheme to protect the privacy security of past, archived sensitive documents, and make sure that all copies of those documents become unreadable by making them utomatically destructed after a predefined time without any human intervention. Comprehensive analysis shows that the ISDS scheme is able to resist not only traditional cryptanalysis and brute-force attack, but also Sybil attacks (e.g., hopping attack and sniffer attack) in the DHT network. More significantly, our ISDS scheme can also provide fine-grained access control during the lifetime of the sensitive documents, which is not guaranteed in other existing schemes.","PeriodicalId":353706,"journal":{"name":"2013 5th International Conference on Intelligent Networking and Collaborative Systems","volume":"2016 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":"114901432","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
扫码关注我们
求助内容：
应助结果提醒方式：