Research on a provable security RFID authentication protocol based on Hash function

2016 ◽  
Vol 23 (2) ◽  
pp. 31-37 ◽  
Author(s):  
Yu Yinhui ◽  
Zhang Lei
Keyword(s):  
Hash Function ◽  
Provable Security ◽  
Authentication Protocol

Authentication protocol of mobile RFID based on Hash function

2013 ◽  
Vol 33 (5) ◽  
pp. 1350-1352
Author(s):  
Peng LIU ◽  
Changhong ZHANG ◽  
Qingyu OU
Keyword(s):  
Hash Function ◽  
Authentication Protocol ◽  
Mobile Rfid

Research on RFID Multi-Authentication Protocol Based on Hash Function

2013 ◽  
Vol 427-429 ◽  
pp. 2403-2407
Author(s):  
She Qiang Peng ◽  
Long Wang
Keyword(s):  
Hash Function ◽  
Data Privacy ◽  
Low Cost ◽  
Formal Analysis ◽  
Authentication Protocol ◽  
Formal Proof ◽  
Data Synchronization ◽  
Location Tracking ◽  
Forward Security ◽  
Security Authentication

To address the security problems caused by the fake readers, and the weakness of low authentication protocol efficiency, a new RFID security authentication protocol based on Hash function is proposed. The security ability of the protocol is compared with other protocols' and is proved by doing the formal analysis. The theoretical analysis and formal proof is presented to prove the security ability of the protocol. Consequently, the result showed that the new protocol could protect the data privacy, achieve the data synchronization, prevent the tag from location tracking, avoid information reproduction, prevent clone and counterfeit and possess forward security ability which was useful for low-cost tags.

scholarly journals Fast Mutual Authentication Using RSA Moduli

2021 ◽  
Author(s):  
Anatoly Anisimov ◽  
Andrey Novokshonov
Keyword(s):  
Hash Function ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Third Party ◽  
Interactive Proof ◽  
Zero Knowledge ◽  
Trusted Third Party ◽  
Secret Information ◽  
Mutual Authentication Protocol

We describe a fast three-round mutual authentication protocol for parties A and B belonging to the same coalition group. Parties A and B keep their own independent long-term private keys that are used in the process of authentication and can be used for other purposes. The scheme assumes an initial setup with a trusted third party T. This party initiates another secret information that includes factors of a large RSA modulus. For authentication, both parties must demonstrate each other the knowledge of their private keys without revealing them and the ability to factorize a large RSA modulus. Thus, the protocol based on the suggested scheme provides reciprocal authentication. The scheme possesses all desirable properties of an interactive proof, i.e., completeness, soundness, and zero-knowledge. The security of the protocol relies on assumptions of difficulty of the RSA factorization and existence of a cryptographic hash function.

scholarly journals Fast Mutual Authentication Using RSA Moduli

2021 ◽  
Author(s):  
Anatoly Anisimov ◽  
Andrey Novokshonov
Keyword(s):  
Hash Function ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Third Party ◽  
Interactive Proof ◽  
Zero Knowledge ◽  
Trusted Third Party ◽  
Secret Information ◽  
Mutual Authentication Protocol

We describe a fast three-round mutual authentication protocol for parties A and B belonging to the same coalition group. Parties A and B keep their own independent long-term private keys that are used in the process of authentication and can be used for other purposes. The scheme assumes an initial setup with a trusted third party T. This party initiates another secret information that includes factors of a large RSA modulus. For authentication, both parties must demonstrate each other the knowledge of their private keys without revealing them and the ability to factorize a large RSA modulus. Thus, the protocol based on the suggested scheme provides reciprocal authentication. The scheme possesses all desirable properties of an interactive proof, i.e., completeness, soundness, and zero-knowledge. The security of the protocol relies on assumptions of difficulty of the RSA factorization and existence of a cryptographic hash function.

scholarly journals Improved An RFID Mutual Authentication Protocol Based on Hash Function

2012 ◽  
Vol 37 (3C) ◽  
pp. 241-250 ◽  
Author(s):  
Ju-Seok Shin ◽  
Se-Jin Oh ◽  
Cheol-Ho Jeong ◽  
Kyung-Ho Chung ◽  
Kwang-Seon Ahn
Keyword(s):  
Hash Function ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Mutual Authentication Protocol
Sign in / Sign up

Export Citation Format

Share Document