Homomorphic Hashing Based on Elliptic Curve Cryptography
Abel C. H. Chen

TL;DR
This paper introduces a new homomorphic hashing method based on elliptic curve cryptography that offers improved efficiency and security for cloud data protection.
Contribution
It proposes a novel ECC-based homomorphic hashing algorithm with mathematical validation and practical experiments demonstrating enhanced efficiency.
Findings
Higher efficiency across various security levels
Mathematical models validating the method
Practical case studies confirming effectiveness
Abstract
For avoiding the exposure of plaintexts in cloud environments, some homomorphic hashing algorithms have been proposed to generate the hash value of each plaintext, and cloud environments only store the hash values and calculate the hash values for future needs. However, longer hash value generation time and longer hash value summary time may be required by these homomorphic hashing algorithms with higher security strengths. Therefore, this study proposes a homomorphic hashing based on elliptic curve cryptography (ECC) to provide a homomorphic hashing function in accordance with the characteristics of ECC. Furthermore, mathematical models and practical cases have been given to prove the proposed method. In experiments, the results show that the proposed method have higher efficiency with different security strengths.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · Chaos-based Image/Signal Encryption
