Minimum Space and Huge Security in 3D Password Scheme: Prof. Sonkar S.K DR - Ghungrad.S.B
Minimum Space and Huge Security in 3D Password Scheme: Prof. Sonkar S.K DR - Ghungrad.S.B
Minimum Space and Huge Security in 3D Password Scheme: Prof. Sonkar S.K DR - Ghungrad.S.B
4, September 2011
Dr.Ghungrad.S.B
(Principal) St. Xavier Technical Institute, Mahim, Mumbai, India
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 users 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 3D virtual environment. The design of the 3-D virtual environment and the type of objects selected determine the 3D 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.
factors such as consistency, uniqueness, and acceptability. One of the main drawbacks of applying biometrics is its intrusiveness upon a users personal characteristic. Moreover, retina biometrical recognition schemes require the user to willingly subject their eyes to a low-intensity infrared light. In addition, most biometric systems require a special scanning device to authenticate users, which is not applicable for remote and Internet users.
Keywords
Authentication, biometrics, graphical passwords, textual passwords, 3-D passwords, 3-D virtual environment.
35
International Journal of Computer Applications (0975 8887) Volume 29 No.4, September 2011
2.1. Environment 1 Chess:First is Chess games in which user construct the 3D password by moving the chess pieces in valid places on chessboard. Second environment is Cube in which user construct the 3D password by moving the Cube left, right, up, down and by rotating the Cube along with option of placing the input images on each side of Cube. In second environment the Cube without no image input in which space required to store 3D password is very less which is advantage for reducing the password space and increase in security. In the registration form after filling all the details of new user, user must have to click on environment1 button to select this environment. The figure 4.1.2 shows that the snapshot of Enviornment1.This particular environment is for chess game. In which it has the total 32 objects 16 White objects and 16 Red objects. And also it includes total seven buttons such as New button, Record button, Stop button, Play button, Confirm button, Close button and Swap button, and one checkbox option. The working of each button is as follows:
Stop button: For ending the sequence of actions and interactions user must have to click on this button. This button stops the recording action and the recorded sequence of action and interaction are saved as a 3-D password in the form of string. Play button: After clicking the stop button, if the user wants to check what he/she has performed as an action and interaction then for that user is require to click on play button. After clicking the play button then user can see the sequence of action and interaction that he/she has recorded as a 3-D password. Confirm button: Once the user click on this button he/she can not change his/her 3-D password. It means that user can change his/her 3D password before clicking on this button by using new button. Close button: After clicking on this button the environment is close and control pass to the registration form.
2.2 Environment 2 Cube:In this dissertation the second environment is a cube. Fig. 4.1.3 shows the snapshot of enviornment2. Whenever user is selecting the enviornment2 then the cube is at initial position which is already setted at (400, 240, 0) co-ordinates with respect to X, Y, Z axis. And one more point that setted in this environment in the form of camera position. This camera position is set at co-ordinates (400, 240,-500) on X, Y, Z axis and acts as a reference point and from this point user can observe the action and interaction that are performed on the cube. This environment has four main actions; each main action has six sub actions and also having the one particular Input action as load image on each side of cube The detail of the four main actions is as follows: Move Cube: This particular main move cube action having the six different sub actions that are- Left, Right, Up, Down, In, Out. Whenever the user is single click on these buttons then the cube moves by 45 co-ordinates with respective to which button is click. The maximum click on each button is six. When a user is clicked on any particular button at seventh time then he/she got the error message as you have reached the maximum limit. Rotate Cube: The next main action is rotate cube with sub actions that are rotate cube x-direction, y-direction, zdirection and x -direction, -y-direction, -z-direction. Whenever the user single clicks on these buttons then the cube rotate in 45 direction with respective to which button is click. The maximum click on each button is six. When a user is clicked on any particular button at seventh time then he/she got the error message as you have reached the maximum limit. Move Camera: Move camera action also having different subaction that is - Left, Right, Up, Down, In, Out. When the user is single click on these buttons then the camera or reference point moves 45 co-ordinates with respective to which button is click. The maximum click on each button is six. When a user is clicked on any particular button at seventh time then he/she got the error message as you have reached the maximum limit. Turn Camera : Turn camera action with different subaction as to rotate camera Left, Right, Up, Down, CW(Clockwise), CCW(Counter clock -Wise) direction. When the user make
Figure.1: Enviornment1 (Chess) New button: Whenever the user is click this button then the all the objects (white and red) are initialized. Before clicking on this button the environment is empty. Swap button: If user wants to change the position of the Red and White objects. This can be done by using this button. In other words it simply swaps the location of White and Red objects respectively. Record button: when user wants to create his/her 3D password it is compulsory to click this button and then all the sequence of actions and interactions are stored as 3D password as a string. If the user is not clicked on the record button then the nothing is recorded and the error is occurred when the stop button is clicked.
36
International Journal of Computer Applications (0975 8887) Volume 29 No.4, September 2011 single click on these buttons then the camera rotate by 45 in direction with respective to which button is click. The maximum click on each button is six. When a user is clicked on any particular button at seventh time then he/she got the error message as you have reached the maximum limit. Load Image: This action is used to load image on each side of cube. This will make user 3D password stronger. User can perform any number of action and interaction on the cube and at the end for to save these action and interaction as a 3-D password, user is require to click on Close button. m All possible actions and interaction towards all existing objects. For our consideration as discussed above the value of m is 20. g(AC) Count of total number of action, input towards the environment. For our consideration as discussed above action is only one i.e. moving the object and the interactions are 3(moving pawn forward, moving either knight in two different ways). So the value of g(AC) is 3. G (G GG) Number of actions, interactions and inputs, for consideration action is only one i.e. move, interactions are 3 and inputs are nil. So the value of G is 3. Lmax The maximum length of password Here Lmax =17. Then the possible password space for our consideration is
n=17
(17, 3) = (20 + 3) n
n=1
43 = 3.771410 The above value gives total number of space (in byte) required to store the password for environment-1.
3.1.2 Enviornment-2(Cube):In environment-2 proposed scheme create password by moving, rotating, zooming the cube. For creating password there are four different actions i.e. moving cube, rotating cube, moving camera, rotating camera along the x, y, z axis. And for each action user can perform the six different interactions. The terms to calculate password space for environment -2 are: G (G GG) number of actions, interactions and inputs. Actions 4 (.moving cube, rotating cube, moving camera, rotating camera), Interactions 6 Input- 6 (Placing an image on each side of cube) So, G = GGG = 466 = 144 m All possible actions, interactions towards all existing objects in environment. For Proposed scheme environment is, for each action we have total 36 interactions so total possible interactions are m = 1679616. Lmax Maximum length of password, for this environment by taking the input i.e. the images on each side of cube having the name six characters wide then the value for Lmax is 111. g (AC) Count of total number actions and interactions towards virtual environment. For this environment it is 24 (6 4) Now, the password space for this environment is (Lmax, G) = (m + g (AC)) n.
n=1 n=Lmax
The white player chooses one of those 20 moves and makes it. The equation for calculating the password space
n=Lmax
(Lmax, G) = (m + g (AC)) n.
n=1
Here,
37
International Journal of Computer Applications (0975 8887) Volume 29 No.4, September 2011 The value of equation 4 gives the total number of space (in byte) required to store passwords for environment-2. Table 1. Comparison between Text and 3-D Password EncryptNo, of Action/ CharacTherefore, G (G GG) number of actions, interactions and inputs. Actions 4 (.moving cube, rotating cube, moving camera, rotating camera) Interactions 6 . So, 1 Input- Nil 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 39 55 71 87 103 119 135 151 167 188 202 218 236 247 263 283 300 319 340 3 4 6 7 8 10 12 13 14 15 16 18 19 20 22 23 24 26 27 19 22 23 24 26 28 31 34 36 39 42 44 39 43 47 51 55 59 63 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 ter ed 3D Password Size of Env-1 in Byte 23 2 Encryptedd Text Password size in Byte Encrypte d 3D Encrypted 3D Passwor Password Size d Size of of Env-2 with no image in Env-2 in Byte 18 8 Byte
3.1.3 Enviornment-2(Cube without no image input):Now we are calculating the password space without taking the input.
G = GG = 46 = 24
m All possible actions, interactions towards all existing objects in environment. For our environment is, for each action we have total 36 interactions so total possible interactions are, m = 1679616 Lmax maximum length of password, for this environment, Lmax is 8 g (AC) count of total number actions and interactions towards virtual environment. For this environment it is 24 (6 4). Now, the password space for this environment is n=Lmax (Lmax, G) = (m + g (AC))n n=1 After placing the values n=8 (8, 24) = (1679616 + 24) n. n=1 =1.474461020 The above value gives the total number of space (in byte) required to store the 3D password for environment-2 without input.
38
International Journal of Computer Applications (0975 8887) Volume 29 No.4, September 2011 EncryptNo, of Action/ Character ed 3D Password Size of Env-1 in Byte 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 354 370 391 402 418 428 439 468 476 487 522 530 546 572 604 612 620 628 652 660 28 30 32 33 34 35 36 38 39 40 42 43 44 46 47 49 50 52 53 54 Encryptedd Text Password size in Byte Encrypte d 3D Passwor Password Size d Size of of Env-2 with no image in Env-2 in Byte 50 55 60 66 71 76 82 60 67 74 80 87 94 100 71 79 87 95 103 111 8 8 8 8 8 8 8 8 8 8 8 8
700
Encrypted 3D
Table 1 shows the comparison of password space required for text and 3-D password for enviornment1, enviornment2 and environment2 with no images. Proposed scheme compared 40 different records by taking length of text password from one character to fourty characters and single action to fourty actions on 3-D objects in environment1 and enviornment2.
Byte
4. CONCLUSION
In 3D password scheme as number of sequence of action and interaction in 3D virtual environment increases then the length of the password is also increases. Therefore to store 3D password space required to store in memory is very large as compared with textual password. In this paper shows that two different 3D virtual environments are analyzed to minimize the space required to store the 3D Password. First environment is Chess game in which user construct the 3D password by moving the chess pieces in valid places on chessboard. Second environment is Cube in which user construct the 3D password by moving the Cube left, right, up, down and by rotating the Cube along with option of placing the input images on each side of Cube. In second environment Cube without no image input in which user can perform more number of action and interaction as compared with first environment and it is observed that space required to store the 3D password is comparatively very less, and the password created is very strong. And security is also increases. Therefore for to minimize the space Required to store the 3D password depends upon well designed 3D virtual environments.
3D Password Size of Env-1 Text Password 3D Password Size of Env-2 3D Password Size in Env-2 with no image
8 8
Size in Character
650 600 550 500 450 400 350 300 250 200 150 100 50 0 1 3 5 7 9 11 13 15 17 19 21 23 25 27 29 31 33 35 37 39 No. of Action/Character
8 8 8 8 8 8
Figure 5.1: comparison of Text and 3-D password for Env-1 & Env-2.
39
International Journal of Computer Applications (0975 8887) Volume 29 No.4, September 2011
5. REFERENCES
[1] Alsulaiman, F.A.; El Saddik, A., "Three- for Secure," IEEE Transactions on Instrumentation and measurement, vol.57, no.9, pp 1929-1938.Sept. 2008 [2] D. V. Klein, Foiling the cracker: A survey of, and to passwords security, in Proc. USENIX Security, , pp.14 [3] 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. [4] X. Suo, Y. Zhu, and G. S. Owen, Graphical passwords: A survey, in Proc. 21st Annual. Computer Security Appl. Conf., Dec. 59, 2005, pp. 463472. [5] D. Weinshall and S. Kirkpatrick, "Passwords Youll Never Forget, but Cant Recall," in Proceedings of Conference on Human Factors in Computing Systems (CHI). Vienna, Austria: ACM, 2004, pp. 1399-1402.
[6] L. Sobrado and J.-C. Birget, "Graphical passwords," The Rutgers Scholar, An Electronic Bulletin for Undergraduate Research, vol. 4, 2002. [7] 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. [8] 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. [9] Two Factor Authentication http://realuser.com/realuser. for the Enterprise,
40