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

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 a Mutual Authentication Protocol in RFID based on Hash Function and CRC Code

2012 ◽  
Vol 37 (2C) ◽  
pp. 132-139
Author(s):  
Se-Jin Oh ◽  
Tae-Jin Yun ◽  
Chang-Hee Lee ◽  
Jae-Kang Lee ◽  
Kyung-Ho Chung ◽  
...  
Keyword(s):  
Hash Function ◽  
Mutual Authentication ◽  
Authentication Protocol ◽  
Mutual Authentication Protocol
Sign in / Sign up

Export Citation Format

Share Document