Search icone
Search and publish your papers

Authentication techniques: An overview

About the author


About the document

Published date
documents in English
term papers
8 pages
0 times
Validated by
  1. Abstract
  2. Introduction
  3. Authentication techniques
    1. Data authentication
    2. Digital signature scheme
    3. Security of digital signature scheme
    4. Forgery of a signature scheme
    5. Entity authentication
    6. Security properties
    7. A scheme based on elliptic curve arithmetic
    8. Analysis of the scheme
  4. Conclusion
  5. References

Authentication is a process by which one can prove the identity of a communicating partner and/or confirm the genuineness of a document. The process becomes a corner stone of security services in any applications ranging from ?defense sector? to ?grocery shop?. Initially, authentication process mostly surrounded by the memorized passwords, but after the remarkable breakthrough in cryptography by Dif?e and Hellman in 1976, various authentication techniques from password to public key concepts have been evolved over the period. This paper tries to focus some of the advanced techniques of authentication. We discuss about Data and Entity authentication and propose a scheme that provides two-factor mutual authentication.

Keywords: Authentication, Digital signature, Smart card, Timestamp

[...] Therefore, investigating authentication techniques would be an important direction. In this paper, we discuss Data authentication and its security notion, and then propose an entity authentication technique that provides two-factor authentication, to have a more robust, secure, and efficient framework to this important theme Authentication Techniques The authentication technique is mainly divided into two categories, namely, Data authentication and Entity authentication Data Authentication Data authentication is a process by which the validity of a document and authenticity of the sender are confirmed. [...]

[...] Efficiency: The authentication phase of the scheme has two stages of computation. The user sends the login request which involves only one elliptic curve point addition and one Map-to-Point operations. The verification of login request requires one elliptic curve point scalar multiplication and one Map-to-Point operation. Thus, the total cost of a successful login requires one elliptic curve point scalar multiplication, one elliptic curve point addition and two Map-to-Point operations. We note that the elliptic curve point multiplication is executed at RS that removes the burden of high computation requirements in a smart card. [...]

[...] The scheme resists the following attacks: Guessing Attack: The guessing attack is a crucial concern in any authentication scheme. We note that our schemes are free from password/veri?er table, and user password is not travelled as a hash of password or similar approach. In our schemes, we let password to travel as hash of other unknown parameters. Therefore, our schemes do not effect by the guessing attacks. Replay Attack: A replay attack (replaying an intercepted login message) cannot work in the scheme. [...]

Recent documents in computer science category

Net neutrality in United States

 Science & technology   |  Computer science   |  Presentation   |  10/02/2018   |   .doc   |   3 pages

Reconstructing householder vectors from tall-skinny QR

 Science & technology   |  Computer science   |  Presentation   |  04/21/2017   |   .doc   |   4 pages