Comparison of Secret Splitting, Secret Sharing and Recursive Threshold Visual Cryptography for Security of Handwritten Images

Abstract

The secret sharing is a method to protect confidentiality and integrity of the secret messages b y distrib uting the message shares into several recipients. The secret message could not b e revealed unless the recipients exchange and collect shares to reconstruct the actual message. Even though the attacker ob tain shares shadow during the share exchange, it would b e impossible for the attacker to understand the correct share. There are few algorithms have b een developed for secret sharing, e.g. secret splittin g, Asmuth-Bloom secret sharing protocol, visual cryptography, etc. There is an unanswered question in this research ab out which method provides b est level of security and efficiency in securing message. In this paper, we evaluate the performance of three m ethods, i.e. secret splitting, secret sharing, and recursive threshold visual cryptography for handwritten image security in terms of execution time and mean squared error (MSE) simulation. Simulation results show the secret splitting algorithm produces th e shortest time of execution. On the other hand, the MSE simulation result that the three methods can reconstruct the original image very well.

Adaptive CSLBP compressed image hashing

“…Content change in an image is treated as malicious operation. The hash code of original and modified image is drastically different or above prescribed threshold when some malicious changes occur in an image [1][2][3][4].…”