TRUTHFUL ACCESS CONTROL OF GRANULAR AGENTS FOR CLOUD-BASED SERVICES

Suneetha Thaduri, S.Shobha Rani, P. Sangeeta

Abstract


A as of late offered get right of entry to keep an eye on original referred to as attribute-based get admission to keep an eye on is an efficient bidder to take on the 1st teaser. It-not most effective provides you know who corroboration but also in addition defines get admission to keep watch over policies per face inside the requester, air, or perchance the data tangle. In an attribute-based get entry to keep watch over arrangement. There are a variety of applying cloud-computing, let's say testimony discussing, knowledge arsenal, big memorandums care, healing break procedure etc. The usual account/password-based proof is not separateness preserving. However, it's properly sanctioned such solitude is a crucial item subsequent regarded as in cloud-computing practices. The umbrella notion of key-insulated cover finished up allow hide lengthy-term keys within a physically-secure but computationally-limited machine. Short-term hush-hush keys are depot by enjoyers at the potent but rocky project locus cryptographic computations transpire. Within previously mentioned news, we suggest a superb-grained two-factor get right of entry to keep an eye on agreement for web-based cloud-computing services and products, utilizing a trivial redemption apparatus. Our compact supports slender attribute-based get right of entry to which provides an exceptional ambidexterity for this process to organize the several get entry to policies in response to the various scenarios. Simultaneously, the separation with the buyer can be preserved.


Keywords


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

References


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.

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.

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.

Joseph K. Liu, Member, IEEE, Man Ho Au, Member, IEEE, Xinyi Huang,Rongxing Lu, Senior Member, IEEE, and Jin Li, “Fine-Grained Two-Factor Access Control forWeb-Based Cloud Computing Services”,

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.


Full Text: PDF

Refbacks

  • There are currently no refbacks.


Bookmark and Share


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.