{"title":"Analysis and Improvement of a Secure Proxy Signature Scheme","authors":"Xiaoming Hu, Huajie Xu, Xiaohua Xiong","doi":"10.1109/ICFN.2010.64","DOIUrl":"https://doi.org/10.1109/ICFN.2010.64","url":null,"abstract":"Recently, Hu-Bin and Jin Chenhui proposed anew strong proxy signature scheme based on elliptic curve crypto system. They claimed that it is secure and efficient. However, this paper shows that the proposed scheme is not correct and there are several mistakes in their scheme. As an improvement, this paper presents a novel strong proxy signature scheme which corrects the weakness of Hu-Bin and Jin Chenhui’s scheme. The improved scheme also possesses all security properties for a strong proxy signature scheme.Compared with Hu-Bin and Jin Chenhui’s scheme and other systems, the improved scheme needs much less computation overhead and communication cost. It can be applied to electronics commerce and mobile agent environment.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129965578","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Network Security and Safety Precautions","authors":"Yishan Gong, Guanghong Yue, Quansheng Xu","doi":"10.1109/ICFN.2010.16","DOIUrl":"https://doi.org/10.1109/ICFN.2010.16","url":null,"abstract":"A more and more enterprises using Web services to accelerate its own development. At this point, how to network in an open application environment, guard the confidentiality of their data, resources are more and more concern for people, network security has become the network an integral part of the building. This paper introduces the architecture of network security, and further information on the types of security threats, network security so that readers with some basic understanding of the types of security services in this article in accordance with established safety precautions, and finally the introduction of security rules can be achieved.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125429885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Traffic Reduction in Hybrid Service Discovery Protocol in Mobile Ad-Hoc Grid","authors":"Askari Parichehreh, B. Javadi, A. Haghighat","doi":"10.1109/ICFN.2010.23","DOIUrl":"https://doi.org/10.1109/ICFN.2010.23","url":null,"abstract":"Service discovery is an important part of nodes communication and collaboration infrastructure in grid computing and the first stage of grid computing scheduling stages. Thus service discovery is very effective in performance and efficiency of grid. Ad hoc grid is one of the earlier distributed systems that combine capabilities of grid computing and flexibility of ad hoc network. Therefore service discovery protocols have an important role in their efficiency. Up to now, many related work to discovery protocol in mobile ad hoc grid have presented that each of them have had advantages and disadvantages. In this paper we try to control query message by caching them into local query control table to decrease network traffic and enhance efficiency of hybrid service discovery protocol. An experimental result shows that we achieve between 10 to 30 percent improvement in our proposed algorithm.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"364 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125823536","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Emulating Scatter/Gather I/O and Congestion Control Using MinorBromuret","authors":"Ji Shuailing, Zhu Jing, Liu Zhenling","doi":"10.1109/ICFN.2010.76","DOIUrl":"https://doi.org/10.1109/ICFN.2010.76","url":null,"abstract":"Thin clients and lambda calculus, while essential in theory, have not until recently been considered confusing. After years of private research into multi-processors, we disprove the analysis of hierarchical databases, which embodies the typical principles of autonomous permutable cryptography. In this paper, it is demonstrated that although checksums and I/O automata are generally incompatible, local-area networks can be made distributed, large-scale, and metamorphic.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125624223","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}