{"title":"Geometric Approaches-Based Key Assignment for Secure Group Communication System","authors":"Lina Ge","doi":"10.1109/ICFN.2010.51","DOIUrl":"https://doi.org/10.1109/ICFN.2010.51","url":null,"abstract":"A key assignment scheme for a secure group communication system based on a geometric approach is proposed. Members obtain the group key by solving multiple linear equations, using both the public information on the notice board and the secret information of their own. The proposed scheme can be divided into three phases: user registration, group key assignment, and group key computation. In the user registration phase, the group controller computes and gives a secret to the new user based on geometric approaches. In the group key assignment phase, the group controller first constructs a secret circle using the group key. Then it computes a shadow of group key for each member based on the shared secret. Finally, each member obtains an additional secret point based on the shared secret. The member obtains the group key in the group key computation phase by its shadow and the public information. The experimental results show that the computation of this scheme is simple and fast. It is dynamic because not only initial key distribution, but also auxiliary operations, such as members joining, members leaving, the group key updating are implemented. The forward secrecy and backward secrecy are assured.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"9 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":"127192047","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":"Reducing Coordinator Failures in Centralized Algorithm to Guarantee Mutual Exclusion Using a Backup Site","authors":"Sadegh Firoozandeh, A. Haghighat","doi":"10.1109/ICFN.2010.45","DOIUrl":"https://doi.org/10.1109/ICFN.2010.45","url":null,"abstract":"In this paper a new algorithm based on the centralized algorithm for mutual exclusion in distributed systems is proposed that instead of one coordinator uses two coordinator On separate sites (But every moment One of them as coordinator whole system).In our method, if for any reason main Coordinator crashes, until recovery it, secondary coordinator controls critical section versus Simultaneous accesses of processes and prevents simultaneous accesses to shared resources. Its functionality is like to centralized algorithm; processes send your request for entrance to critical section first to main coordinator and if it has been crashed, send your request to secondary coordinator. Unlike the centralized algorithm in proposed algorithm coordinator is not a point of failure and with crashing coordinator, entire system doesn’t go down. The proposed algorithm against the failure of coordinator is much flexible.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"36 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":"126479607","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":"Improving QoE Using a Novel Multipath Routing Based on Source and Intermediate Node Forwarding","authors":"Hewei Yu, N. Maxemchuk","doi":"10.1109/ICFN.2010.69","DOIUrl":"https://doi.org/10.1109/ICFN.2010.69","url":null,"abstract":"This paper proposes a simple and effective algorithm to improve the quality of service on the Internet by providing alternate path between source and destination nodes when the delay or packet loss rate on the primary path becomes unacceptable. We combine Source Routing with an Intermediate Node forwarding mechanism to yield a multipath routing mechanism called SIR (Source Intermediate Routing). It includes a simple algorithm to place the intermediate nodes so that the alternate paths have as few common links and nodes as possible. Simulation shows SIR can reduce the probability of path congestion when some links are congested and provide an adequate quality of service.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"3 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":"122187510","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}
H. Elkamchouchi, F. Ahmed, A. A. Elsoud, Dalia H. Elkamchouchi
{"title":"New Symmetric Cipher Enhanced by Rotor in Real & Gaussian Domains (SCER)","authors":"H. Elkamchouchi, F. Ahmed, A. A. Elsoud, Dalia H. Elkamchouchi","doi":"10.1109/ICFN.2010.86","DOIUrl":"https://doi.org/10.1109/ICFN.2010.86","url":null,"abstract":"This paper gives a new symmetric cryptosystem using twelve rounds enhanced by sixteen wheels rotor operating on all the 256 characters indicated by the ASCII. It uses thirty-two bits S-boxes implemented using thirty-two bits affine transformation modulo 232 addition and thirty-two bits XORING are used followed by modulo 232+1 multiplication. Numerical results are used to implement the proposed cryptosystem. The strength of this system is compared with the well known DES and IDEA symmetric systems and gives excellent results from the point of view of the security characteristics and the statistics of the ciphertext.","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":"134338306","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":"A New Energy-Aware Scheme for RFID System Based on ALOHA","authors":"Kaixing Wu, Yuankun Liu","doi":"10.1109/ICFN.2010.29","DOIUrl":"https://doi.org/10.1109/ICFN.2010.29","url":null,"abstract":"Radio Frequency Identification (RFID) is promising, as a technique, to enable tracking of essential information about objects as they pass through supply chains. Due to the growth of new applications where multiple tag identification is a fundamental request, a problem called tag collision appears. When attempting to identify multiple RFID tags, the base station may faces up a simultaneous interfering transmission from transponders which may causes a collision as tags share the same communication channel. Also energy consumption is becoming another serious problem in RFID Systems. For this generic multi access communication and power dissipation problem, one algorithm AMAS has been proposed to identify tags efficiently, and make tags energy-aware.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"72 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":"133808811","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":"The Analysis of Knowledge Transfer Network Characteristic Based on Small-world Network Model","authors":"Yang Bo, Xu Sheng-hua","doi":"10.1109/ICFN.2010.15","DOIUrl":"https://doi.org/10.1109/ICFN.2010.15","url":null,"abstract":"By analysising Small-world Network Model and its algorithm, we adopt agent adaptability modeling method of Complex Adaptive System and use Multi-Agent development language Netlogo to build simulation model based on Knowledge Transfer Network of Small-world. We use the average path length of Small-world Network Characteristic and clustering coefficient to stand for AC frequency and aggregation degree between network organizations’ network nodes. Operating simulation model means Knowledge Transfer Network has evident Small-world Network Characteristic and confirms that under the condition of Small-world, the efficiency of Agent behavior and organization Knowledge Transfer can reach an upper high standard. It can offer theory director to construct adaptive knowledge communication between network organizations and changeable network construction.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"27 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":"121277777","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":"The Realization of the Support System of the Substation in .NET Framework","authors":"J. Hua","doi":"10.1109/ICFN.2010.18","DOIUrl":"https://doi.org/10.1109/ICFN.2010.18","url":null,"abstract":"At present, many transformer substations had installed all kinds of management information system, these systems were usually independency and redundancy, so they can not share computer resources each other. A support system was developed, which based on the .NET framework. This system can help to manage all kinds of data by using the computer database at a same system, so the data can be shared and be accessed conveniently. The system also can collect and analyze the information on high voltage electric equipment test data.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"1 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":"128932304","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":"Improved Genetic Feedback Algorithm Based Network Security Policy Frame Work","authors":"Atish Mishra, A. Jhapate, Prakash Kumar","doi":"10.1109/ICFN.2010.96","DOIUrl":"https://doi.org/10.1109/ICFN.2010.96","url":null,"abstract":"Earlier the model suggested was much generalized and simple. It was lacking in clarity about the functioning of its components, which made it difficult to be implemented. In this paper an improved model for the security policy framework is suggested, in which functioning of each component and there interconnectivity is explained clearly. The fitness functions for the system and which parameter can be used to decide to define a gene for a network event is also discussed and a method to calculate the fitness of a network event is also given.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"94 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":"128484532","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":"Biological Intrusion Prevention and Self-Healing Model for Network Security","authors":"Muna Elsadig, Azween Abduallah","doi":"10.1109/ICFN.2010.103","DOIUrl":"https://doi.org/10.1109/ICFN.2010.103","url":null,"abstract":"This paper describes a new approach for network security based on the combination of biological intrusion prevention and self-healing concepts. The presented system integrates an artificial immune intrusion prevention system for network security inspired by immunological theory known as danger theory. The approach is based upon data inspired by the human immune system (HIS). The IPS analyzes the malicious activities and their effect to trigger the self-healing system. That is detection of the damage caused by malicious activities is used to start the self - healing (SH) mechanism. This system is automated and enhances the fault repair and system recovery.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"27 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":"116850129","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":"X-MODDES (eXtended Multi Operator Delimiter Based Data Encryption Standard)","authors":"P. Gope, A. Kaushik, Kushal Arora, N. Kumar","doi":"10.1109/ICFN.2010.67","DOIUrl":"https://doi.org/10.1109/ICFN.2010.67","url":null,"abstract":"An Algorithm is considered computationally secure if it can not be broken with standard resources, either current or future. In this paper we have introduced a new block cipher algorithm named X-MODDES. It is unique independent approach which uses several computational steps along with string of operators and randomized delimiter selections by using some suitable mathematical logic. X-MODDES is specially designed to produce different cipher texts by applying same key on same plain text. Thus a new protocol has been designed to encrypt a given text, which allows a higher level security as compare to MODDES. The Algorithm is successfully implemented on text file, corresponding digital image file and audio file. Here we have also tried to highlight the performance of some well known data algorithms like DES, Triple-DES, AES (Rijndael), MODDES, and compare them with the X-MODDES. Finally it has been proved that X-MODDES is one of the best performing partial symmetric key algorithm among the above mention algorithms particularly for the text message with limited size.","PeriodicalId":185491,"journal":{"name":"2010 Second International Conference on Future Networks","volume":"1 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":"126713881","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}