Abstract: In this era of online communication, which transacts data in 0s and 1s, confidentiality is a priced commodity. Ensuring safe transmission of encrypted data and their uncorrupted recovery is a matter of prime concern. Among the several techniques for secure sharing of images, this paper proposes a k out of n region incrementing image sharing scheme for color images. The highlight of this scheme is the use of simple Boolean and arithmetic operations for generating shares and the Lagrange interpolation polynomial for authenticating shares. Additionally, this scheme addresses problems faced by existing algorithms such as color reversal and pixel expansion. This paper regenerates the original secret image whereas the existing systems regenerates only the half toned secret image.
Abstract: A new steganographic method via the use of numeric
data on public websites with a self-authentication capability is
proposed. The proposed technique transforms a secret message into
partial shares by Shamir’s (k, n)-threshold secret sharing scheme with
n = k + 1. The generated k+1 partial shares then are embedded into the
numeric items to be disguised as part of the website’s numeric content,
yielding the stego numeric content. Afterward, a receiver links to the
website and extracts every k shares among the k+1 ones from the stego
numeric content to compute k+1 copies of the secret, and the
phenomenon of value consistency of the computed k+1 copies is taken
as an evidence to determine whether the extracted message is authentic
or not, attaining the goal of self-authentication of the extracted secret
message. Experimental results and discussions are provided to show
the feasibility and effectiveness of the proposed method.