DUAL ACCESS CONTROL OF THE EXACT COMPONENTS OF CLOUD COMPUTING WEB SERVICES

G Sainadh, K Vijay Kumar

Abstract


During this qualifier, we manufacture an utterly new graceful-ingrained two-agent authentication (two-FA) access subdue system for envelop-based blacken-number services. Particularly, within our suggested two-FA attack censure system, a diagnostic-based accessibility government mechanism is accomplished with involve both a person latent linchpin along with a whippersnapper, jackanapes shelter device. As being a user cannot hyphen somewhere once they assume have both, the machinery can intensify the firth of mind in the shape, distinctly in distinctive’s scenarios where plot of users shares just the same computer for weaver-based sully avail. There are 2 strikes for your standard narration/pword based system. First, the traditional computation/watchword-nourish authentication isn't prolateness-aid. Within the token or feeling formula, it captures the key agent along with the SEM together. In addition, repute-based control within the system also empower the taint server to bound using concrete’s users sticking with the same quantity of reputation while deducting custom retirement, i.e., the damage salver only verify that the principal accomplishes the perpendicular found but doesn't have conception across the strict identity within the user. Within the autograph verification or march pamphlet in code formula, it seizes the customer common key along with the correspondent unity. Finally, we execute a simulation to prove the feasibility interior our allude to two-FA system.


Keywords


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

References


J. Camenisch, M. Dubovitskaya, and G. Neven, “Oblivious transfer with access control,” in Proc. 16th ACM Conf. Comput. Commun. Secur. (CCS), Chicago, IL, USA, Nov. 2009, pp. 131–140.

J. Camenisch and A. Lysyanskaya, “A signature scheme with efficient protocols,” in Proc. 3rd Int. Conf. Secur. Commun. Netw. (SCN), Amalfi, Italy, Sep. 2002, pp. 268–289.

K. Liang et al., “A DFA-based functional proxy re-encryption scheme for secure public cloud data sharing,” IEEE Trans. Inf. Forensics Security, vol. 9, no. 10, pp. 1667–1680, Oct. 2014.

K. Liang, J. K. Liu, D. S. Wong, and W. Susilo, “An efficient cloud-based revocable identity-based proxy re-encryption scheme for public clouds data sharing,” in Proc. 19th ESORICS, 2014, pp. 257–272.

M. Nabeel, N. Shang, and E. Bertino, “Privacy preserving policy-based content sharing in public clouds,” IEEE Trans. Knowl. Data Eng., vol. 25, no. 11, pp. 2602–2614, Nov. 2013.

T. Okamoto, “Receipt-free electronic voting schemes for large scale elections,” in Proc. 5th Int. Workshop Secur. Protocols, 1997, pp. 25–35.


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.