Block-Level Message-Locked Encryption with Polynomial Commitment for IoT Data

The promise of smart city leads to store massive sensitive IoT data from various sources in cloud storage. Storage burden and security concern are the most challenging issues. Message-Locked Encryption (MLE) and Proof of Storage (PoS) are useful tools to solve these problems. MLE encrypts data meanwhile enabling deduplication on them to save storage, and PoS checks data integrity in case of any data corruption. However, trivial combination of PoS with MLE results in additional metadata which contradicts with the aim of deduplication. Therefore, how to integrate PoS with MLE for IoT data is an interesting research problem. To solve this problem, we propose a block-level message-locked encryption scheme with polynomial commitment for IoT data, called BL-MLE-PC. We introduce a unique set of metadata called Quadruple Tags (QTs) which serve as: block identifiers, PoW tags, PoS tags and decryption keys. In addition, we apply polynomial commitment to obtain fast and efficient data auditing. Our scheme can deduplicate under block-level for fine-grained saving. We prove our scheme is secure under predefined security models. The analysis shows our scheme is efficient.

[1]  Xingming Sun,et al.  Enabling Personalized Search over Encrypted Outsourced Data with Efficiency Improvement , 2016, IEEE Transactions on Parallel and Distributed Systems.

[2]  Guomin Yang,et al.  Probabilistic Public Key Encryption with Equality Test , 2010, CT-RSA.

[3]  Fuchun Guo,et al.  BL-MLE: Block-Level Message-Locked Encryption for Secure Large File Deduplication , 2015, IEEE Transactions on Information Forensics and Security.

[4]  Nor Badrul Anuar,et al.  The role of big data in smart city , 2016, Int. J. Inf. Manag..

[5]  Daniel R. L. Brown,et al.  The Static Diffie-Hellman Problem , 2004, IACR Cryptology ePrint Archive.

[6]  Dan Boneh,et al.  Short Signatures Without Random Oracles , 2004, EUROCRYPT.

[7]  Benny Pinkas,et al.  Proofs of ownership in remote storage systems , 2011, CCS '11.

[8]  Zhe Liu,et al.  Efficient Implementation of NIST-Compliant Elliptic Curve Cryptography for 8-bit AVR-Based Sensor Nodes , 2016, IEEE Transactions on Information Forensics and Security.

[9]  Shucheng Yu,et al.  Proofs of retrievability with public verifiability and constant communication cost in cloud , 2013, Cloud Computing '13.

[10]  Jing Chen,et al.  Proofs of Ownership and Retrievability in Cloud Storage , 2014, 2014 IEEE 13th International Conference on Trust, Security and Privacy in Computing and Communications.

[11]  F. Moore,et al.  Polynomial Codes Over Certain Finite Fields , 2017 .

[12]  Xingming Sun,et al.  Toward Efficient Multi-Keyword Fuzzy Search Over Encrypted Outsourced Data With Accuracy Improvement , 2016, IEEE Transactions on Information Forensics and Security.

[13]  Mihir Bellare,et al.  Message-Locked Encryption and Secure Deduplication , 2013, EUROCRYPT.

[14]  Ari Juels,et al.  Pors: proofs of retrievability for large files , 2007, CCS '07.

[15]  Shouhuai Xu,et al.  Secure and efficient proof of storage with deduplication , 2012, CODASPY '12.

[16]  Shucheng Yu,et al.  Secure and constant cost public cloud storage auditing with deduplication , 2013, 2013 IEEE Conference on Communications and Network Security (CNS).

[17]  Hovav Shacham,et al.  Hedged Public-Key Encryption: How to Protect against Bad Randomness , 2009, ASIACRYPT.

[18]  Jia Xu,et al.  Leakage Resilient Proofs of Ownership in Cloud Storage, Revisited , 2014, ACNS.

[19]  Antonio Iera,et al.  The Internet of Things: A survey , 2010, Comput. Networks.

[20]  Jian Shen,et al.  A Novel Routing Protocol Providing Good Transmission Reliability in Underwater Sensor Networks , 2015 .

[21]  M. Mrinalni Vaknishadh,et al.  Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing , 2012 .

[22]  Lida Xu,et al.  The internet of things: a survey , 2014, Information Systems Frontiers.

[23]  Hovav Shacham,et al.  Compact Proofs of Retrievability , 2008, Journal of Cryptology.

[24]  I. Reed,et al.  Polynomial Codes Over Certain Finite Fields , 1960 .

[25]  Jin Wang,et al.  Mutual Verifiable Provable Data Auditing in Public Cloud Storage , 2015 .

[26]  Prajakta A. Satarkar,et al.  Developing A Secure Cloud Storage System for Storing IoT Data by Applying Role Based Encryption , 2016 .

[27]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[28]  Ian Goldberg,et al.  Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.

[29]  Reza Curtmola,et al.  Provable data possession at untrusted stores , 2007, CCS '07.