Dynamic PoS and Secure Cross-User De-duplication

M. Mounika, B. Maha Lakshmi

Abstract


We present the idea of deduplicatable dynamic confirmation of capacity and propose an effective development called DeyPoS, to accomplish dynamic PoS and secure cross-client deduplication, at the same time. Considering the difficulties of structure assorted qualities and private tag generation, we exploit a novel instrument called Homomorphic Authenticated Tree (HAT). We demonstrate the security of our development, and the hypothetical examination and trial comes about demonstrate that our development is efficient in practice.


References


S. Kamara and K. Lauter, “Cryptographic cloud storage,” in Proc. of FC, pp. 136–149, 2010.

Z. Xia, X. Wang, X. Sun, and Q. Wang, “A Secure and Dynamic Multi-Keyword Ranked Search Scheme over Encrypted Cloud Data,” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 2, pp. 340–352, 2016.

Z. Xiao and Y. Xiao, “Security and privacy in cloud computing,” IEEE Communications Surveys Tutorials, vol. 15, no. 2, pp. 843–859, 2013.

C. A. Ardagna, R. Asal, E. Damiani, and Q. H. Vu, “From Security to Assurance in the Cloud: A Survey,” ACM Comput. Surv., vol. 48, no. 1, pp. 2:1–2:50, 2015.

G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in Proc. of CCS, pp. 598–609, 2007.

G. Ateniese, R. Di Pietro, L. V. Mancini, and G. Tsudik, “Scalable and Efficient Provable Data Possession,” in Proc. of SecureComm, pp. 1–10, 2008.

G. Ateniese, S. Kamara, and J. Katz, “Proofs of storage from homomorphic identification protocols,” in Proc. of ASIACRYPT, pp. 319–333, 2009.

C. Erway, A. K¨upc ¨u, C. Papamanthou, and R. Tamassia, “Dynamic provable data possession,” in Proc. of CCS, pp. 213–222, 2009.

R. Tamassia, “Authenticated Data Structures,” in Proc. of ESA, pp. 2–5, 2003.

Q. Wang, C. Wang, J. Li, K. Ren, and W. Lou, “Enabling public verifiability and data dynamics for storage security in cloud computing,” in Proc. of ESORICS, pp. 355–370, 2009.

F. Armknecht, J.-M. Bohli, G. O. Karame, Z. Liu, and C. A. Reuter, “Outsourced proofs of retrievability,” in Proc. of CCS, pp. 831–843, 2014.

H. Shacham and B. Waters, “Compact Proofs of Retrievability,” Journal of Cryptology, vol. 26, no. 3, pp. 442–483, 2013.

Z. Mo, Y. Zhou, and S. Chen, “A dynamic proof of retrievability (PoR) scheme with o(logn) complexity,” in Proc. of ICC, pp. 912–916, 2012.

E. Shi, E. Stefanov, and C. Papamanthou, “Practical dynamic proofs of retrievability,” in Proc. of CCS, pp. 325–336, 2013.

S. Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg, “Proofs of ownership in remote storage systems,” in Proc. of CCS, pp. 491–500, 2011.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

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