In this paper,based on coupled network generated by chaotic logarithmic map,a novel algorithm for constructing hash functions is proposed,which can transform messages and can establish a mapping from the transformed m...In this paper,based on coupled network generated by chaotic logarithmic map,a novel algorithm for constructing hash functions is proposed,which can transform messages and can establish a mapping from the transformed messages to the coupled matrix of the network.The network model is carefully designed to ensure the network dynamics to be chaotic.Through the chaotic iterations of the network,quantization and exclusive-or (XOR) operations,the algorithm can construct hash value with arbitrary length.It is shown by simulations that the algorithm is extremely sensitive to the initial values and the coupled matrix of the network,and has excellent performance in one-way,confusion and diffusion,and collision resistance.展开更多
When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a ma...When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.展开更多
Research on existing radio frequency identification（RFID） authentication protocols security risks, poor performance and other problems, a RFID security authentication protocol based on dynamic identification（ID） a...Research on existing radio frequency identification（RFID） authentication protocols security risks, poor performance and other problems, a RFID security authentication protocol based on dynamic identification（ID） and Key value renewal is proposed. Meanwhile, the security problems based on Hash function RFID security authentication protocol in recent years have been also sorted and analyzed. Then a security model to design and analyze RFID protocols is built. By using the computational complexity, its correctness and security have been proved. Compared with the safety performance, storage overhead, computational overhead and other aspects of other protocols, the protocol for RFID has more efficient performance and ability to withstand various attacks. And the C# programming language is used to simulate the authentication process on the visual studio platform, which verifies the feasibility of the protocol.展开更多
In order to meet people’s demand for various types of network services,researchers have conducted extensive research on authentication schemes for multi-server architecture.Although various schemes have been proposed...In order to meet people’s demand for various types of network services,researchers have conducted extensive research on authentication schemes for multi-server architecture.Although various schemes have been proposed,most of them still have safety defects and fail to meet safety requirements.Recently,Haq et al presented an efficient Hash-based authenticated key agreement scheme for multi-server scheme and claimed that their scheme can withstand all well-known attacks.However,we find that their scheme is vulnerable to replay attack,tracking attack and malicious server impersonation user attack.Then we propose an improved scheme.We also analyze the security of the improved scheme and compare with Haq et al’s scheme in security and computational efficiency.Furthermore,we use the AVISPA(Automated Validation of Internet Security Protocols and Applications)tool to verify the security of the improved scheme.展开更多
The low-cost RFID tags have very limited computing and storage resources and this makes it difficult to completely solve their security and privacy problems. Lightweight authentication is considered as one of the most...The low-cost RFID tags have very limited computing and storage resources and this makes it difficult to completely solve their security and privacy problems. Lightweight authentication is considered as one of the most effective methods to ensure the security in the RFID system. Many light-weight authentication protocols use Hash function and pseudorandom generator to ensure the anonymity and confidential communication of the RFID system. But these protocols do not provide such security as they claimed. By analyzing some typical Hash-based RFID authentication protocols, it is found that they are vulnerable to some common attacks. Many protocols cannot resist tracing attack and de-synchronization attack. Some protocols cannot provide forward security. Gy?z? Gódor and Sándor Imre proposed a Hash-based authentication protocol and they claimed their protocol could resist the well-known attacks. But by constructing some different attack scenarios, their protocol is shown to be vulnerable to tracing attack and de-synchronization attack. Based on the analysis for the Hash-based authentication protocols, some feasible suggestions are proposed to improve the security of the RFID authentication protocols.展开更多
RFID(Radio Frequency IDentification)系统射频标签结构简单,且与阅读器间采用无线方式传输数据,易产生隐私泄露和受到安全攻击。针对该问题,文中提出通过双向轻权认证协议来保护RFID系统的安全性和隐私。该协议通过随机化标签的秘密...RFID(Radio Frequency IDentification)系统射频标签结构简单,且与阅读器间采用无线方式传输数据,易产生隐私泄露和受到安全攻击。针对该问题,文中提出通过双向轻权认证协议来保护RFID系统的安全性和隐私。该协议通过随机化标签的秘密信息再哈希的方法生成会话消息,标签与阅读器间采用二次相互认证,提升了协议的安全性。该协议通过哈希运算确保认证过程中会话信息的保密传输和完整性,通过对标签端每次发出会话消息的随机化确保了消息的新鲜性,系统秘密信息的更新确保协议满足前向安全性。RFID认证协议不仅能抵抗窃听、追踪、重放、去同步化等攻击,还能满足RFID系统的安全性和隐私保护需要。展开更多
基金supported by the Program for New Century Excellent Talents in University of China(No.NCET-06-0510)National Natural Science Founda-tion of China(No. 60874091)Six Projects Sponsoring Talent Summits of Jiangsu Province(No. SJ209006)
文摘In this paper,based on coupled network generated by chaotic logarithmic map,a novel algorithm for constructing hash functions is proposed,which can transform messages and can establish a mapping from the transformed messages to the coupled matrix of the network.The network model is carefully designed to ensure the network dynamics to be chaotic.Through the chaotic iterations of the network,quantization and exclusive-or (XOR) operations,the algorithm can construct hash value with arbitrary length.It is shown by simulations that the algorithm is extremely sensitive to the initial values and the coupled matrix of the network,and has excellent performance in one-way,confusion and diffusion,and collision resistance.
文摘When developing programs or websites, it is very convenient to use relational databases, which contain powerful and convenient tools that allow to work with data very flexibly and get the necessary information in a matter of milliseconds. A relational database consists of tables and records in these tables, each table must have a primary key, in particular, it can be a number of BIGINT type, which is a unique index of a record in the table, which allows to fetch operation with maximum speed and O (1) complexity. After the operation of writing a row to the table of database, the program receives the row identifier ID in the form of a number, and in the future this ID can be used to obtain this record. In the case of a website, this could be the GET method of the http protocol with the entry ID in the request. But very often it happens that the transmission of an identifier in the clear form is not safe, both for business reasons and for security reasons of access to information. And in this case, it is necessary to create additional functionality for checking access rights and come up with a way to encode data in such a way that it would be impossible to determine the record identifier, and this, in turn, leads to the fact that the program code becomes much more complicated and also increases the amount of data, necessary to ensure the operation of the program. This article presents an algorithm that solves these problems “on the fly” without complicating the application logic and does not require resources to store additional information. Also, this algorithm is very reliable since it is based on the use of hash functions and synthesized as a result of many years of work related to writing complex systems that require an increased level of data security and program performance.
基金supported by the National Basic Research Program of China (2015CB453000)
文摘Research on existing radio frequency identification（RFID） authentication protocols security risks, poor performance and other problems, a RFID security authentication protocol based on dynamic identification（ID） and Key value renewal is proposed. Meanwhile, the security problems based on Hash function RFID security authentication protocol in recent years have been also sorted and analyzed. Then a security model to design and analyze RFID protocols is built. By using the computational complexity, its correctness and security have been proved. Compared with the safety performance, storage overhead, computational overhead and other aspects of other protocols, the protocol for RFID has more efficient performance and ability to withstand various attacks. And the C# programming language is used to simulate the authentication process on the visual studio platform, which verifies the feasibility of the protocol.
基金Supported by the Applied Basic and Advanced Technology Research Programs of Tianjin(15JCYBJC15900)。
文摘In order to meet people’s demand for various types of network services,researchers have conducted extensive research on authentication schemes for multi-server architecture.Although various schemes have been proposed,most of them still have safety defects and fail to meet safety requirements.Recently,Haq et al presented an efficient Hash-based authenticated key agreement scheme for multi-server scheme and claimed that their scheme can withstand all well-known attacks.However,we find that their scheme is vulnerable to replay attack,tracking attack and malicious server impersonation user attack.Then we propose an improved scheme.We also analyze the security of the improved scheme and compare with Haq et al’s scheme in security and computational efficiency.Furthermore,we use the AVISPA(Automated Validation of Internet Security Protocols and Applications)tool to verify the security of the improved scheme.
文摘The low-cost RFID tags have very limited computing and storage resources and this makes it difficult to completely solve their security and privacy problems. Lightweight authentication is considered as one of the most effective methods to ensure the security in the RFID system. Many light-weight authentication protocols use Hash function and pseudorandom generator to ensure the anonymity and confidential communication of the RFID system. But these protocols do not provide such security as they claimed. By analyzing some typical Hash-based RFID authentication protocols, it is found that they are vulnerable to some common attacks. Many protocols cannot resist tracing attack and de-synchronization attack. Some protocols cannot provide forward security. Gy?z? Gódor and Sándor Imre proposed a Hash-based authentication protocol and they claimed their protocol could resist the well-known attacks. But by constructing some different attack scenarios, their protocol is shown to be vulnerable to tracing attack and de-synchronization attack. Based on the analysis for the Hash-based authentication protocols, some feasible suggestions are proposed to improve the security of the RFID authentication protocols.
文摘RFID(Radio Frequency IDentification)系统射频标签结构简单,且与阅读器间采用无线方式传输数据,易产生隐私泄露和受到安全攻击。针对该问题,文中提出通过双向轻权认证协议来保护RFID系统的安全性和隐私。该协议通过随机化标签的秘密信息再哈希的方法生成会话消息,标签与阅读器间采用二次相互认证,提升了协议的安全性。该协议通过哈希运算确保认证过程中会话信息的保密传输和完整性,通过对标签端每次发出会话消息的随机化确保了消息的新鲜性,系统秘密信息的更新确保协议满足前向安全性。RFID认证协议不仅能抵抗窃听、追踪、重放、去同步化等攻击,还能满足RFID系统的安全性和隐私保护需要。
