SUPER OBTAINED TWO FACTORS GET THE CHANCE TO CONTROL FOR WEB APPLICATIONS

Ediga Deepthi, D. Venkateshwarlu

Abstract


Personally, introduce a totally new fine-grained two-factor authentication (two-fa) access control procedure for web-based cloud-computing services. particularly, within our offered two-fa access control rule, a characteristic-based access control mechanism is implemented with involve both a person secret key along with a lightweight security device. as being a user cannot connect somewhere once they don't hold both, electrifying mechanism can enhance tense peace of mind in sensational machine, particularly in individual’s scenarios where lots of users share exactly suspenseful same computer for web-based cloud services. there are 2 troubles for your standard account/password-based arrangement. first, electrifying traditional account/password-based authentication isn't privacy-preserving. within powerful signing or understanding formula, it takes histrionic key factor along with suspenseful seem together. in addition, attribute-based control within powerful organization also enables electrifying cloud server ending with limit using individual’s users sticking with melodramatic same quantity of attributes while preserving user privacy, i.e., melodramatic cloud server only understands that striking client fulfills histrionic right predicate but doesn't have idea across tense exact identity within impressive user. within sudden signature verification or file encryption formula, it takes startling client public key along with electrifying corresponding identity. finally, privately implement a reproduction so describe tense feasibility within our propounded two-fa structure.


Keywords


Fine-Grained; Two-Factor; Access Control;Web Services;

References


T. Okamoto and K. Takashima, “Efficient attribute-based signatures for non-monotone predicates in the standard model,” in Public Key Cryptography (Lecture Notes in Computer Science), vol. 6571. Berlin, Germany: Springer-Verlag, 2011, pp. 35–52.

S. S. M. Chow, C. Boyd, and J. M. G. Nieto, “Security-mediated certificate less cryptography,” in Public Key Cryptography (Lecture Notes in Computer Science), vol. 3958. Berlin, Germany: Springer-Verlag, 2006, pp. 508–524.

F. Xhafa, J. Wang, X. Chen, J. K. Liu, J. Li, and P. Krause, “An efficient PHR service system supporting fuzzy keyword search and fine-grained access control,” Soft Compute., vol. 18, no. 9, pp. 1795–1802, 2014.

M. Li, S. Yu, Y. Zheng, K. Ren, and W. Lou, “Scalable and secure sharing of personal health records in cloud computing using attribute based encryption,” IEEE Trans. Parallel Distrib. Syst., vol. 24, no. 1, pp. 131–143, Jan. 2013.

Y. Dodis and A. Yampolskiy, “A verifiable random function with short proofs and keys,” in Public Key Cryptography (Lecture Notes in Computer Science), vol. 3386, S. Vaudenay, Ed. Berlin, Germany: Springer-Verlag, 2005, pp. 416–431.

X. Huang et al., “Cost-effective authentic and anonymous data sharing with forward security,” IEEE Trans. Compute., vol. 64, no. 4, pp. 971–983, Apr. 2015.


Full Text: PDF

Refbacks

  • There are currently no refbacks.




Copyright © 2012 - 2021, All rights reserved.| ijitr.com

Creative Commons License
International Journal of Innovative Technology and Research is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJITR , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.