Research Article
BiCross : Minimum Space and Huge Security in 3D Password Scheme
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 29 - Issue 4 |
| Published: September 2011 |
| Authors: Prof. Sonkar S.K, Dr.Ghungrad.S.B |
10.5120/3552-4872
|
Prof. Sonkar S.K, Dr.Ghungrad.S.B . BiCross : Minimum Space and Huge Security in 3D Password Scheme. International Journal of Computer Applications. 29, 4 (September 2011), 35-40. DOI=10.5120/3552-4872
@article{ 10.5120/3552-4872,
author = { Prof. Sonkar S.K,Dr.Ghungrad.S.B },
title = { BiCross : Minimum Space and Huge Security in 3D Password Scheme },
journal = { International Journal of Computer Applications },
year = { 2011 },
volume = { 29 },
number = { 4 },
pages = { 35-40 },
doi = { 10.5120/3552-4872 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2011
%A Prof. Sonkar S.K
%A Dr.Ghungrad.S.B
%T BiCross : Minimum Space and Huge Security in 3D Password Scheme%T
%J International Journal of Computer Applications
%V 29
%N 4
%P 35-40
%R 10.5120/3552-4872
%I Foundation of Computer Science (FCS), NY, USA
Abstract
The 3-D password is a multifactor authentication scheme. For the authentication, it is require to presents a 3-D virtual environment where the user navigates and interacts with various objects. The sequence of actions and interactions toward the objects inside the 3-D environment constructs the user’s 3-D password. The 3-D password can combine most existing authentication schemes such as textual passwords, graphical passwords, and various types of biometrics into a 3-D virtual environment. The design of the 3-D virtual environment and the type of objects selected determine the 3-D password key space. As per the reference[1] the author tells that the resulting 3D password space is very huge. In this paper we shows that the space is reduced and increase the security.
References
- Alsulaiman, F.A.; El Saddik, A., "Three- for Secure," IEEE Transactions on, Instrumentation and measurement, vol.57, no.9, pp 1929-1938.Sept. 2008
- D. V. Klein, “Foiling the cracker: A survey of, and to passwords security,” in Proc. USENIX Security, , pp.–14
- I. Jermyn, A. Mayer, F. Monrose, M. K. Reiter, and A. D. Rubin, “The design and analysis of graphical passwords,” in Proc. 8th USENIX Security Symp,Washington DC, Aug.1999, pp.1-14.
- X. Suo, Y. Zhu, and G. S. Owen, “Graphical passwords: A survey,” in Proc. 21st Annual. Computer Security Appl. Conf., Dec. 5–9, 2005, pp. 463–472.
- D. Weinshall and S. Kirkpatrick, "Passwords You’ll Never Forget, but Can’t Recall," in Proceedings of Conference on Human Factors in Computing Systems (CHI). Vienna, Austria: ACM, 2004, pp. 1399-1402.
- L. Sobrado and J.-C. Birget, "Graphical passwords," The Rutgers Scholar, An Electronic Bulletin for Undergraduate Research, vol. 4, 2002.
- D. Hong, S. Man, B. Hawes, and M. Mathews, "A password scheme strongly resistant to spyware," in Proceedings of International conference on security and management. Las Vergas, NV, 2004.
- S. Man, D. Hong, and M. Mathews, "A shouldersurfing resistant graphical password scheme," in Proceedings of International conference on security and management. Las Vegas, NV, 2003.
Index Terms
Keywords