Block-level message-locked encryption with polynomial commitment for IoT data

Journal of Information Science and Engineering

Volumn 33, Issue 4, 2017, Pages 891-905

  Huang, Ke ^a   Zhang, Xiao Song ^a   Wang, Xiao Fen ^a  

^a UNIVERSITY OF ELECTRONIC SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Deduplication; IoT data; Message locked encryption; Polynomial commitment; Smart city

Indexed keywords

DIGITAL STORAGE; INTERNET OF THINGS; LOCKS (FASTENERS); METADATA; POLYNOMIALS; PROBLEM SOLVING; SECURITY OF DATA; SMART CITY;

DATA CORRUPTION; DATA INTEGRITY; DE DUPLICATIONS; DECRYPTION KEYS; ENCRYPTION SCHEMES; IOT DATA; RESEARCH PROBLEMS; SECURITY MODEL;

CRYPTOGRAPHY;

EID: 85049095409     PISSN: 10162364     EISSN: None     Source Type: Journal    
DOI: 10.6688/JISE.2017.33.4.2     Document Type: Article

References (29)

1. S. Li, L. D. Xu, and S. Zhao, “The internet of things: A survey,” Information Systems Frontiers, Vol. 17, 2015, pp. 243-259.
2. I. A. T. Hashem, V. Chang, N. B. Anuar, K. Adewole, I. Yaqoob, A. Gani, E. Ahmed, and H. Chiroma, “The role of big data in smart city,” International Journal of Information Management, Vol. 36, 2016, pp. 748-758.
3. J. Shen, H. Tan, J. Wang, J. Wang, and S. Lee, “A novel routing protocol providing good transmission reliability in underwater sensor networks,” Journal of Internet Technology, Vol. 16, 2015, pp. 171-178.
4. J. D. Bokefode, A. S. Bhise, P. A. Satarkar, and D. G. Modani, “Developing a secure cloud storage system for storing IoT data by applying role based encryption,” Pro-cedia Computer Science, Vol. 89, 2016, pp. 43-50.
5. Z. Fu, K. Ren, J. Shu, X. Sun and F. Huang, “Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement,” IEEE Transactions on Parallel and Distributed Systems, Vol. 27, 2015, pp. 2546-2559.
6. Z. Fu, X. Wu, C. Guan, X. Sun, and K. Ren, “Towards efficient multi-keyword fuzzy search over encrypted outsourced data with accuracy improvement,” IEEE Transactions on Information Forensics and Security, 2016, p. 1.
7. Cloud Security Alliance, “Top threats to cloud computing,” 2010, http://www.cloudsecurityalliance.org.
8. M. Bellare, S. Keelveedhi, and T. Ristenpart, “Message-locked encryption and secure deduplication,” in Proceedings of the 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, 2013, pp. 296-312.
9. S. Halevi, D. Harnik, B. Pinkas, and A. Shulman-Peleg, “Proofs of ownership in remote storage systems,” in Proceedings of ACM Conference on Computer and Communications Security, 2011, pp. 491-500.
10. G. Ateniese, R. Burns, R. Curtmola, J. Herring, L. Kissner, Z. Peterson, and D. Song, “Provable data possession at untrusted stores,” in Proceedings of ACM Conference on Computer and Communications Security, Vol. 14, 2007, pp. 598-609.
11. Q. Wang, C. Wang, K. Ren, W. Lou, and J. Li, “Enabling public auditability and data dynamics for storage security in cloud computing,” IEEE Transactions on Parallel and Distributed Systems, Vol. 22, 2010, pp. 847-859.
12. Y. Ren, J. Shen, J. Wang, J. Han, and S. Lee, “Mutual verifiable provable data auditing in public cloud storage,” Journal of Internet Technology, Vol. 16, 2015, pp. 317-323.
13. A. Juels and B. S. Kaliski, “PORs: Proofs of retrievability for large files,” in Proceedings of ACM Conference on Computer and Communications Security, 2007, pp. 584-597.
14. J. Yuan and S. Yu, “Proofs of retrievability with public verifiability and constant communication cost in cloud,” International Workshop on Security in Cloud Computing, 2013, pp. 19-26.
15. H. Shacham and B. Waters, “Compact proofs of retrievability,” Journal of Cryptology, Vol. 26, 2013, pp. 442-483.
16. Q. Zheng and S. Xu, “Secure and efficient proof of storage with deduplication,” in Proceedings of ACM Conference on Data and Application Security and Privacy, 2011, pp. 1-12.
17. J. Yuan and S. Yu, “Secure and constant cost public cloud storage auditing with de duplication,” in Proceedings of IEEE Conference on Communications and Network Security, 2013, pp. 145-153.
18. R. Du, L. Deng, J. Chen, K. He, and M. Zheng, “Proofs of ownership and retrievability in cloud storage,” in Proceedings of IEEE International Conference on Trust, Security and Privacy in Computing and Communications, 2014, pp. 328-335.
19. R. Chen, Y. Mu, G. Yang, and F. Guo, “BL-MLE: Block-level message-locked encryption for secure large file deduplication,” IEEE Transactions on Information Forensics and Security, Vol. 10, 2015, pp. 2643-2652.
20. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, Vol. 22, 1976, pp. 644-654.
21. D. R. L. Brown and R. P. Gallant, “The static Diffie-Hellman problem,” Cryptology ePrint Archive, http://eprint.iacr.org/, 2004.
22. D. Boneh and X. Boyen, “Short signatures without random oracles,” Lecture Notes in Computer Science, Vol. 3352, 2015, pp. 134-148.
23. A. Kate, G. M. Zaverucha, and I. Goldberg, “Constant-size commitments to polynomials and their applications,” in Proceedings of International Conference on Theory and Application of Cryptology and Information Security, Vol. 6477, 2010, pp. 177-194.
24. I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” Journal of the Society for industrial and Applied Mathematics, Vol. 8, 1960, pp. 300-304.
25. G. Yang, C. H. Tan, Q. Huang, and D. S. Wong, “Probabilistic public key encryption with equality test,” in Proceedings of International Conference on Topics in Cryptology, Vol. 5985, 2010, pp. 119-131.
26. J. Xu and J. Zhou, “Leakage resilient proofs of ownership in cloud storage, revisited,” Applied Cryptography and Network Security, 2014, pp. 97-115.
27. M. Bellare, Z. Brakerski, M. Noar, T. Ristenpart, G. Segev, H. Shacham, and S. Yilek, “Hedged public-key encryption: How to protect against bad randomness,” in Proceedings of International Conference on Theory and Application of Cryptology and Information Security: Advances in Cryptology, Vol. 5912, 2009, pp. 232-249.
28. Z. Liu, X. Huang, Z. Hu, M. K. Khan, H. Seo, and L. Zhou, “On emerging family of elliptic curves to secure internet of things: ECC comes of age,” IEEE Transactions on Dependable and Secure Computing, 2016, pp. 1-12.
29. Z. Liu, H. Seo, J. Großschädl, and H. Kim, “Efficient implementation of NIST-com-pliant elliptic curve cryptography for 8-bit AVR-based sensor nodes,” IEEE Transactions on Information Forensics and Security, Vol. 11, 2015, pp. 1385-1397.