REFINED DUAL ASPECT ENTRÉE MANAGEMENT FOR CLOUD SERVICES

A.Chanikya Chakravarthi, R.Raj Kumar

Abstract


In this particular paper, we introduce a totally new fine-grained two-factor authentication (two-FA) access control system for web-based cloud-computing services. Particularly, inside our recommended two-FA access control system, a characteristic-based access control mechanism is implemented with involve both an individual secret key plus a lightweight security device. As being a user cannot connect somewhere after they don't hold both, the mechanism can enhance the reassurance within the machine, specifically in individual’s scenarios where plenty of users share the identical computer for web-based cloud services. There's two troubles for your standard account/password based system. First, the traditional account/password-based authentication is not privacy-preserving. Inside the signing or understanding formula, it requires the important thing factor coupled with SEM together. In addition, attribute-based control inside the system also enables the cloud server to limit using individual’s users utilizing the same quantity of attributes while preserving user privacy, i.e., the cloud server only recognizes that the customer fulfills the most effective predicate, but does not have idea inside the exact identity inside the user. Inside the signature verification or file encryption formula, it requires the customer public key coupled with corresponding identity. Finally, we perform simulation to demonstrate the practicability within our recommended two-FA system.


Keywords


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

References


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.

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.

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 - 2023, 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.