Secret sharing scheme based on binary trees and Boolean operation

摘要

Conventional visual secret sharing schemes hide a secret into a number of shares, which are either printed or in digital form. Noise-like pixels appear due to hiding a secret in shares, but during the transmission of shares, it increases the interception risk. Hence, visual secret sharing schemes suffer from a transmission risk problem. To solve this problem, we propose a secret sharing scheme which will allow the sender to divide the secret into \(2^h\) shares using a full binary tree structure and Boolean XOR, where h is the height of the tree. A man-in-the-middle attack is only possible if the attacker knows the number of shares the sender has generated. The attacker cannot decipher the secret using less than \(2^h\) number of shares. This scheme is secure and takes minimum computation time for sharing as well as recovery of a secret. The proposed scheme works good on binary, grayscale, and colored images, and recovery of this scheme is lossless.