Learn More
A novel approach to secret image sharing based on a ðk; nÞ-threshold scheme with the additional capabilities of steganography and authentication is proposed. A secret image is first processed into n shares which are then hidden in n user-selected camouflage images. It is suggested to select these camouflage images to contain well-known contents, like famous(More)
The pattern deformational model proposed by Tsai and Fu [11] is extended so that numerical attributes and probability or density distributions can be introduced into primitives and relations in a nonhierarchical relational graph Conventional graph isomor-phisms are then generalized to include error-correcting capability for matching deformed patterns(More)
A graph matching approach is proposed in this paper for solving the task assignment problem encountered in distributed computing systems. A cost function defined in terms of a single unit, time, is proposed for evaluating the effectiveness of task assignment. This cost function represents the maximum time for a task to complete module execution and(More)
A ðk; nÞ-threshold visual cryptography scheme is proposed to encode a secret image into n shadow images, where any k or more of them can visually recover the secret image, but any k À 1 or fewer of them gain no information about it. The decoding process of a visual cryptography scheme, which differs from traditional secret sharing, does not need complicated(More)
A new covert communication method via PDF files is proposed. A secret message, after being encoded by a special ASCII code and embedded at between-word and between-character locations in the text of a PDF file, becomes invisible in the window of a common PDF reader, creating a steganographic effect for secret transmission through the PDF file. Experimental(More)