Homomorphic Authentication Based on Rank-Based Merkle Hash Tree

Under the settings of cloud storage, user’s private data is distributed and sent to different servers for storage service, thus authentication systems are required to ensure data integrity. In this paper, combining the idea of Dario Catalanno’s arithmetic circuit with Rank-based Merkle Hash Tree structure, a novel homomorphic authentication scheme is proposed. The main advantage of the proposed scheme is that the integrity of data transmission can be validated between different servers.

[1]  Rosario Gennaro,et al.  Generalizing Homomorphic MACs for Arithmetic Circuits , 2014, IACR Cryptol. ePrint Arch..

[2]  Vinod Vaikuntanathan,et al.  How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption , 2012, IACR Cryptol. ePrint Arch..

[3]  Craig Gentry,et al.  Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers , 2010, CRYPTO.

[4]  Ari Juels,et al.  Proofs of retrievability: theory and implementation , 2009, CCSW '09.

[5]  Dario Fiore,et al.  Practical Homomorphic MACs for Arithmetic Circuits , 2013, IACR Cryptol. ePrint Arch..

[6]  Jian Shen,et al.  Provable data transfer from provable data possession and deletion in cloud storage , 2017, Comput. Stand. Interfaces.

[7]  D. Boneh,et al.  Short Signatures from the Weil Pairing , 2001, Journal of Cryptology.

[8]  Yevgeniy Vahlis,et al.  Verifiable Delegation of Computation over Large Datasets , 2011, IACR Cryptol. ePrint Arch..

[9]  Li,et al.  Cloud Storage Technology and Its Applications , 2010 .

[10]  Juebo Wu,et al.  Research and Application of Cloud Storage , 2010, 2010 2nd International Workshop on Intelligent Systems and Applications.

[11]  P. Varalakshmi,et al.  Integrity checking for cloud environment using encryption algorithm , 2012, 2012 International Conference on Recent Trends in Information Technology.

[12]  Rosario Gennaro,et al.  Fully Homomorphic Message Authenticators , 2013, IACR Cryptol. ePrint Arch..