With the development and wide application of WSN (Wireless Sensor Network), the information security becomes a serious problem, especially when the WSN applied in military field. Whereas the general WSN routing protocols focus on the transmission efficiency, reliability and energy-efficiency, not on the security. This paper integrates the international popular AES encryption standard, RSA public-key encryption mechanism and digital signature technology to improve classic AODV routing protocol, and shows an SAODV routing protocol which has both energy efficiency and information security. The theoretical analysis and simulation show: when adding security mechanism to AODV in the routing layer, the system owns the defensive ability for the hidden security problem, such as the eavesdropping, coaxing, imitation, replay, denial of service and HELLO diffusion etc and the normal performance of the network almost conform to the AODV protocol.
{"title":"Information Security Routing Protocol in the WSN","authors":"Li Wei, Chengwu Ming, Liu Mingming","doi":"10.1109/IAS.2009.260","DOIUrl":"https://doi.org/10.1109/IAS.2009.260","url":null,"abstract":"With the development and wide application of WSN (Wireless Sensor Network), the information security becomes a serious problem, especially when the WSN applied in military field. Whereas the general WSN routing protocols focus on the transmission efficiency, reliability and energy-efficiency, not on the security. This paper integrates the international popular AES encryption standard, RSA public-key encryption mechanism and digital signature technology to improve classic AODV routing protocol, and shows an SAODV routing protocol which has both energy efficiency and information security. The theoretical analysis and simulation show: when adding security mechanism to AODV in the routing layer, the system owns the defensive ability for the hidden security problem, such as the eavesdropping, coaxing, imitation, replay, denial of service and HELLO diffusion etc and the normal performance of the network almost conform to the AODV protocol.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"10 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114135922","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 paper presents embedded system design project based on RFID (Radio-Frequency Identification) securities. The project adopts RFID to complete reading and writing tags, and embedded system to implement system control, communication, signal processing, showing results, human-computer interaction, and so on. Module of RFID is made of MFCR500 of Philips, AT89S52 of Atmel, and integrated antenna. The embedded system is made of S3C2410 as kernel chip from Samsung. The whole system integrates portable securities, communication, and distribution management.
{"title":"Paper Study of Embedded System Design Based on RFID Securities","authors":"Ling-feng Shi, X. Lai, Bao-Long Guo","doi":"10.1109/IAS.2009.199","DOIUrl":"https://doi.org/10.1109/IAS.2009.199","url":null,"abstract":"The paper presents embedded system design project based on RFID (Radio-Frequency Identification) securities. The project adopts RFID to complete reading and writing tags, and embedded system to implement system control, communication, signal processing, showing results, human-computer interaction, and so on. Module of RFID is made of MFCR500 of Philips, AT89S52 of Atmel, and integrated antenna. The embedded system is made of S3C2410 as kernel chip from Samsung. The whole system integrates portable securities, communication, and distribution management.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114192121","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}
An algorithm for one-way hash function construction based on conservative chaotic system is proposed. The plaintext is divided into a group of message blocks by a fixed length and each message block is iterated some times through standard map. Both the iterations results of every round and the plaintext block determine the two initial values and the steps of iterations in next round. Some items of the result in the final round are chosen to be transformed into Hash value of 128 bits. Theoretical analysis and computer simulation show that this algorithm has good effect in irreversibility, weak collision and sensitivity to initial values. The method is safer in security than the Hash function based on low- dimensional dissipative chaotic maps and it is easy to realize.
{"title":"One-way Hash Function Construction Based on Conservative Chaotic Systems","authors":"Qing-hua Zhang, Han Zhang, Z. Li","doi":"10.1109/IAS.2009.209","DOIUrl":"https://doi.org/10.1109/IAS.2009.209","url":null,"abstract":"An algorithm for one-way hash function construction based on conservative chaotic system is proposed. The plaintext is divided into a group of message blocks by a fixed length and each message block is iterated some times through standard map. Both the iterations results of every round and the plaintext block determine the two initial values and the steps of iterations in next round. Some items of the result in the final round are chosen to be transformed into Hash value of 128 bits. Theoretical analysis and computer simulation show that this algorithm has good effect in irreversibility, weak collision and sensitivity to initial values. The method is safer in security than the Hash function based on low- dimensional dissipative chaotic maps and it is easy to realize.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114399020","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}
Mathematical method was studied for the non-uniformity correction of IRFPA based on radiation source scaling for the engineering applications of infrared imaging system. It is indicated that the complicated engineering problem can be solved by the method of function interpolation or function fitting. Some dependent correction algorithms are derived based on this principle, such as cubic spline function interpolation, B-spline function least squares fitting and polynomial least squares fitting. These algorithms are proved by experiments that they can highly adapt to the broad dynamic range and non-linearity of IRFPA and are suitable for engineering applications with fast computing speed and high calibration precision.
{"title":"Nonuniformity Correction Algorithms of IRFPA Based on Radiation Source Scaling","authors":"En-ke Li, Shangqian Liu, Shimin Yin, Xiao-ning Fu","doi":"10.1109/IAS.2009.110","DOIUrl":"https://doi.org/10.1109/IAS.2009.110","url":null,"abstract":"Mathematical method was studied for the non-uniformity correction of IRFPA based on radiation source scaling for the engineering applications of infrared imaging system. It is indicated that the complicated engineering problem can be solved by the method of function interpolation or function fitting. Some dependent correction algorithms are derived based on this principle, such as cubic spline function interpolation, B-spline function least squares fitting and polynomial least squares fitting. These algorithms are proved by experiments that they can highly adapt to the broad dynamic range and non-linearity of IRFPA and are suitable for engineering applications with fast computing speed and high calibration precision.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"291 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128591529","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}
Donghai Tian, Changzhen Hu, Yang Qi, Jianqiao Wang
Alert correlation is a promising technique in intrusion detection. It takes the alerts produced by intrusion detection systems and produces compact reports which provide a more succinct and high-level view of occurring or attempted intrusions and highly improve security expert’s work efficiency. Traditional alert correlation system adopts a centralized architecture which can be easily over flooded by the raw alarms. To address this issue, a distributed alert correlation model based on hierarchical architecture is proposed. This model greatly improves the performance of alert correlation through integrating three novel methods. The experiments show effectiveness of this alert correlation model on 2000 DARPA intrusion detection scenario specific datasets.
{"title":"Hierarchical Distributed Alert Correlation Model","authors":"Donghai Tian, Changzhen Hu, Yang Qi, Jianqiao Wang","doi":"10.1109/IAS.2009.26","DOIUrl":"https://doi.org/10.1109/IAS.2009.26","url":null,"abstract":"Alert correlation is a promising technique in intrusion detection. It takes the alerts produced by intrusion detection systems and produces compact reports which provide a more succinct and high-level view of occurring or attempted intrusions and highly improve security expert’s work efficiency. Traditional alert correlation system adopts a centralized architecture which can be easily over flooded by the raw alarms. To address this issue, a distributed alert correlation model based on hierarchical architecture is proposed. This model greatly improves the performance of alert correlation through integrating three novel methods. The experiments show effectiveness of this alert correlation model on 2000 DARPA intrusion detection scenario specific datasets.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129015063","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 orthogonal algorithm and protocol of efficient group key management for secure multicast in distributed systems. In the proposed method, the sever only requires to multicast to update the group key after a subgroup or a user left and therefore bandwidth is reduced effectively. The nice features of the proposed scheme include few messages required in updating and almost instant reception of the new key information. Performance evaluation for the proposed scheme is also presented to show the superiority of the proposed method.
{"title":"An Efficient Hierarchical Group Key Management Scheme Based on Orthogonal Vectors","authors":"Junchang Wang, X. Lin","doi":"10.1109/IAS.2009.237","DOIUrl":"https://doi.org/10.1109/IAS.2009.237","url":null,"abstract":"This paper proposes a novel orthogonal algorithm and protocol of efficient group key management for secure multicast in distributed systems. In the proposed method, the sever only requires to multicast to update the group key after a subgroup or a user left and therefore bandwidth is reduced effectively. The nice features of the proposed scheme include few messages required in updating and almost instant reception of the new key information. Performance evaluation for the proposed scheme is also presented to show the superiority of the proposed method.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124786651","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}
Although RBAC model has received broad support as a generalized access control solution, it has several innate limitations. We propose a Role and Activity Based Access Control model called R-ABAC, which extends the traditional RBAC model with the notion of participation, act and activity. An activity is an abstraction of the application environment, and organizes participations and acts as a digraph for expressing dependency of activity steps, as well as containing rich context information such as time, location and system status. An implementation of R-ABAC model has been applied to a university unified identity and access management system (UIAMS).
{"title":"A Role and Activity Based Access Control Model for University Identity and Access Management System","authors":"Shuliang Zheng, D. Jiang, Qixin Liu","doi":"10.1109/IAS.2009.43","DOIUrl":"https://doi.org/10.1109/IAS.2009.43","url":null,"abstract":"Although RBAC model has received broad support as a generalized access control solution, it has several innate limitations. We propose a Role and Activity Based Access Control model called R-ABAC, which extends the traditional RBAC model with the notion of participation, act and activity. An activity is an abstraction of the application environment, and organizes participations and acts as a digraph for expressing dependency of activity steps, as well as containing rich context information such as time, location and system status. An implementation of R-ABAC model has been applied to a university unified identity and access management system (UIAMS).","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129644117","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 2005, Yoon et al. proposed a user-friendly remote user authentication scheme using smart cards. The security of their scheme is based on one-way hash function and they claimed that their scheme is secured from attacks and achievable for proving mutual authentication, freely choosing password, no verification tables, and involving very lightweight hashing operations. However, we find that Yoon et al.’s scheme suffers from the denial of service attack and performs only unilateral authentication (only user authentication). In this paper we consequently propose an enhanced version to eliminate the vulnerability. Furthermore, our enhanced scheme can also provide mutual authentication and key agreement between a remote server and login users.
{"title":"An Enhanced Remote User Authentication Scheme Providing Mutual Authentication and Key Agreement with Smart Cards","authors":"Chun-Ta Li","doi":"10.1109/IAS.2009.17","DOIUrl":"https://doi.org/10.1109/IAS.2009.17","url":null,"abstract":"In 2005, Yoon et al. proposed a user-friendly remote user authentication scheme using smart cards. The security of their scheme is based on one-way hash function and they claimed that their scheme is secured from attacks and achievable for proving mutual authentication, freely choosing password, no verification tables, and involving very lightweight hashing operations. However, we find that Yoon et al.’s scheme suffers from the denial of service attack and performs only unilateral authentication (only user authentication). In this paper we consequently propose an enhanced version to eliminate the vulnerability. Furthermore, our enhanced scheme can also provide mutual authentication and key agreement between a remote server and login users.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127029992","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}
Wuping Chen, Lei Zhang, Bo Qin, Qianhong Wu, Huanguo Zhang
Key agreement is one of the fundamental cryptographic primitives in public key cryptography. It plays an important role for securing systems in practice. In this paper, we present the first certificateless One-Way authenticated Two-Party key agreement protocol. The security of the proposed protocol is analyzed based on the intractability of the standard discrete logarithm (DL) and bilinear Diffie-Hellman (BDH) problems. For efficiency, our protocol enjoys low complexity in both communication and computation.
{"title":"Certificateless One-Way Authenticated Two-Party Key Agreement Protocol","authors":"Wuping Chen, Lei Zhang, Bo Qin, Qianhong Wu, Huanguo Zhang","doi":"10.1109/IAS.2009.183","DOIUrl":"https://doi.org/10.1109/IAS.2009.183","url":null,"abstract":"Key agreement is one of the fundamental cryptographic primitives in public key cryptography. It plays an important role for securing systems in practice. In this paper, we present the first certificateless One-Way authenticated Two-Party key agreement protocol. The security of the proposed protocol is analyzed based on the intractability of the standard discrete logarithm (DL) and bilinear Diffie-Hellman (BDH) problems. For efficiency, our protocol enjoys low complexity in both communication and computation.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123929003","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}
Tao Niu, Yingjia Zhang, D. Zhang, Liqiang Liu, Xianjue Luo
A novel topology analysis method is presented to analyze the testability of grounding grids, and creditability is firstly proposed as an important index to evaluate the results. In this method, inaccessible nodes are eliminated by wye-delta transformation, followed by the calculation of testability and creditability index in the reverse direction. Simulation results are provided to prove this method.
{"title":"Testability Analysis of Grounding Grids Using Network Transformation","authors":"Tao Niu, Yingjia Zhang, D. Zhang, Liqiang Liu, Xianjue Luo","doi":"10.1109/IAS.2009.238","DOIUrl":"https://doi.org/10.1109/IAS.2009.238","url":null,"abstract":"A novel topology analysis method is presented to analyze the testability of grounding grids, and creditability is firstly proposed as an important index to evaluate the results. In this method, inaccessible nodes are eliminated by wye-delta transformation, followed by the calculation of testability and creditability index in the reverse direction. Simulation results are provided to prove this method.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124214182","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
扫码关注我们
求助内容：
应助结果提醒方式：