ACCESS CONTROL IS STRICTLY CHECKED WITH MANY AGENCIES RESPONSIBLE FOR PUBLIC WAREHOUSE STORAGE

G. Priyanka, B. Swathi

Abstract


Cloud users no longer actually have their data, just how they ensure the integrity of the data being outsourced becomes a difficult task. Recently, proposed plans, for example, "possess testable data" and "non-recoverable tests" have been developed to address this problem, but are being reviewed to file data, which for this reason does not support sufficient data dynamics. In addition, threat models typically assume a true data owner and focus on the discovery of a dishonest cloud company, although customers also misbehave. This document proposes an open review plan that supports data dynamics and fair arbitration of potential disputes. In particular, we designed a catalog selector to eliminate the limitation of the use of indexes in calculating labels in current schemas and to obtain effective management of information dynamics. To address the equity problem to ensure that no party behaves badly without disclosure, we have expanded existing threat models and adopted the idea of ​​exchanging signatures to establish fair arbitration protocols to ensure that any possible dispute can be resolved. A fair solution. The security analysis shows that our plan may be safe, and the performance evaluation shows that the overloading of information dynamics and arbitration in disputes is reasonable.


Keywords


Dynamic Update; Arbitration; Fairness; Integrity Auditing; Public Verifiability;

References


B. Chen, R. Curtmola, G. Ateniese, and R. Burns, “Remote data checking for network coding-based distributed storage systems,” in Proc. ACM Cloud Computing Security Workshop (CCSW 10), 2010, pp. 31–42.

T. S. Schwarz and E. L. Miller, “Store, forget, and check: Using algebraic signatures to check remotely administered storage,” in Proc. IEEE Intl Conf. Distributed Computing Systems (ICDCS 06), 2006, pp. 12–12.

Z. Hao, S. Zhong, and N. Yu, “A privacy-preserving remote data integrity checking protocol with data dynamics and public verifiability,” IEEE Trans. Knowledge and Data Eng., vol. 23, no. 9, pp. 1432–1437, 2011.

N. Asokan, V. Shoup, and M. Waidner, “Optimistic fair exchange of digital signatures,” in Proc. 17th Intl Conf. Theory and Applications of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT98), 1998, pp. 591–606.

HaoJin, Hong Jiang, Senior Member, IEEE, and Ke Zhou, “Dynamic and Public Auditing with Fair Arbitrationfor Cloud Data”, ieee transactions on cloud computing 2016.

Y. Zhu, H.Wang, Z. Hu, G.-J. Ahn, H. Hu, and S. S. Yau, “Dynamic audit services for integrity verification of outsourced storages in clouds,” in Proc. ACM Symp. Applied Computing (SAC 11), 2011, pp. 1550–1557.

D. Boneh, C. Gentry, B. Lynn, and H. Shacham, “Aggregate and verifiably encrypted signatures from bilinear maps,” in Proc. 22nd Intl Conf. Theory and Applications of Cryptographic Techniques: Advances in Cryptology (EUROCRYPT03), 2003, pp. 416–432.


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.