Homomorphic authentication based on rank-based merkle hash tree

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Bai, P., Zhang, W., Wang, X. A., Liu, Y., Yang, H. B., & Shan, C. (2018). Homomorphic authentication based on rank-based merkle hash tree. In Lecture Notes on Data Engineering and Communications Technologies (Vol. 17, pp. 841–848). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-319-75928-9_76

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free