In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. The scheme is perfectly secure and very easy to implement. We extend it into a visual variant ofthek out of n secret sharing problem, in which a dealer provides a

We propose a watermarking scheme to hide copyright information in an image. The scheme employs visual masking to guarantee that the embedded watermark is invisible and to maximize the robustness of the hidden data. The watermark is constructed for arbitrary image blocks by filtering a pseudo

Manetho is a new transparent rollback-recovery protocol for long-running distributed computations. It uses a novel combination of antecedence graph maintenance, uncoordinated checkpointing, and sender-based message logging. Manetho simultaneously achieves the advantages of pessimistic message

Abstract. We present an election scheme designed to allow voters to verify that their vote is accurately included in the tabulation. The scheme provides a high degree of transparency whilst ensuring the secrecy of votes. Assurance is derived from close auditing of all the steps of the vote

implementations (to my knowledge) of transparent migration need either a custom runtime system (e.g. [13]) or global source code transformation (e.g. [12]). Our Method. In this presentation, I describe a library to enable transparent migration in standard Scheme. Unlike existing implementations, it requires

system in latest Linux kernel. A high-end compression system could be introduced in Ext2/3. It will be helpful in reducing data footprint in Linux based server environment. With slight modifications and using the sparse block feature of Ext2/3 file system transparent compression could be achieved

Should workers be informed of the incentive schemes governing their team co-workers? Should workers be told on which performance measure they will be as-sessed? Should workers be told how important the tasks are for the organization? This paper shows in an abstract moral hazard setup why in rich

Should workers be informed of the incentive schemes governing their team co-workers? Should workers be told on which performance measure they will be as-sessed? Should workers be told detailed statistics about workersattitudes in the past? This paper shows in an abstract moral hazard setup why

sense, any watermarking technique that attempts to incorporate an invisible mark into an image is perceptually based. However, in order to provide transparency (invisibility of the watermark) and robustness to attack, more sophisticated use of perceptual information in the watermarking process

Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching to transparently reduce geometry bandwidth. Use of an indexed triangle strip representation permits application programs