 |
| Journal of Information Security Research |
| An Authentication of Significant security for accessing Password through Network System | Syed Umar
MLR Institute of Technology, Hyderabad, India | | Abstract: Significant security password to authenticate users on a network system network system for small and large. Text passwords is the standard form of authentication of users on the site for comfort and convenience. In fact, it probably caught on the user’s password with various threats and vulnerabilities and threats. ordinary users use text passwords for authentication when they register with the selected account on the site. weak password selected by the user and the application between the sites that a domino effect. Additionally, enter the password of the computer thief a password is not a reliable
threat arrival could begin passwords, such as phishing, key loggers and capturing malware attacks steal. OPASS introduce more help with a specific user authentication protocol in this paper. The concept of the universal system and methods of organizations and users to implement password policies. The system is designed for user authentication protocols OTP relating to benefit the users of mobile phones and short message services giant passwords and reuse of passwords to steal a series of attacks. OPass a live phone number of each contribution, this unique recreation and telecom service providers involved have shot three OPASS, users need to log in a password on any computer in the long-term prototype website. After
remembering OPASS, we believe OPASS effective and inexpensive compared to a conventional web authentication mechanism. | | Keywords: Security, Authentication, Messages, OPass, Networking, Password An Authentication of Significant security for accessing Password through Network System |
| DOI:https://doi.org/10.6025/jisr/2019/10/1/18-23 |  Full_Text PDF (218 KB) Download: 149 times | | References:[1] Hung-Min Sun, Yao-Hsin Chen., Yue-Hsun Lin. (2012). oPass: A User Authentication Protocol Resistant to Password
Stealing and Password Reuse Attacks, IEEE Transactions On Information Forensics And Security, 7(2) (April).
[2] Florencio, D., Herley, C. (2007). A large- scale study of web password habits, In: WWW ’07: Proc. 16th Int. Conf. World Wide
Web., New York, 2007, p. 657–666, ACM.
[3] Chiasson, S., Forget, A., Stobert, E., P. C. (2009). Multiple password interference in text passwords and click-based graphical
passwords, In: CCS ’09: Proc. 16th ACM Conf. Computer Communications Security, New York, 2009, p. 500–511, ACM.
[4] Wiedenbeck, S., Waters, J., Sobrado, L., Birget, J.-C. (2006). Design and evaluation of a shoulder-surfing resistant graphical
password scheme, In: AVI ’06: Proc. Working Conf. Advanced Visual Interfaces, New York, 2006, p. 177–184, ACM.
[5] Gawand, S., Felten, E. W. (2006). Password management strategies for online accounts, In: SOUPS ’06: Proc. 2nd Symp.
Usable Privacy. Security, New York, 2006, p. 44–55, ACM.
[6] Ives, B., Walsh, K. R., Schneider, H. (2004). The domino effect of password reuse, Commun. ACM, 47 (4) 75–78.
[7] Wiedenbeck, S., Waters, J., Birget, J.-C., Brodskiy, A., Memon, N. (2005). Passpoints: Design and longitudinal evaluation of
a graphical password system, International Journal of Human-Computer Studies, 63 (1–2)102– 127.
[8] Pinkas, B., Sander, T. (2002). Securing passwords against dictionary attacks, In: CCS ’02: Proc. 9th ACM Conf. Computer
Communications Security, New York, 2002, p. 161–170, ACM.
[9] Thorpe, J., Van Oorschot, P. (2004). Towards secure design choices for implementing graphical passwords, presented at the 20th. Annu. Computer Security Applications Conference., 2004.
[10] Jermyn, A., Mayer, F., Monrose, M. K., Reiter, Rubin, A. D. The design and analysis of graphical passwords, In: SSYM’99:
Proc. 8thConf. USENIX Security Symp., Berkeley, CA, 1999, p. 1–1, USENIX Association.
[11] Perrig, A., Song, D. Hash visualization: A new technique to improve real-world security, In: Proc. Int.Workshop Cryptographic
Techniques-Commerce, Citeseer, 1999, p. 131– 138.
|
|
|
|
|
