Lossy channel systems are systems of finite state automata that communicate via unreliable unbounded fifo channels. Today the main open question in the theory of lossy channel systems is whether bisimulation is decidable. We show that bisimulation, simulation, and in fact all relations between bisimulation and trace inclusion are undecidable for lossy channel systems (and for lossy vector addit...

A lossy compression tolerant data hiding method is proposed in this paper. The image which hides data is named a stego-image. Most of data hiding methods will lose some hidden data when the stego-image is compressed by lossy compression process. However, there are few people will transmit image without lossy compression in the public internet. By the proposed method, the stego-image can be comp...

We introduce a general construction of fully simulatable oblivious transfer based on lossy encryption. Furthermore, we extend the common definition of lossy encryption by introducing the notion of computationally lossy encryption. If the cryptosystem used is computationally lossy, our general construction yields oblivious transfer protocols with computational security for both parties. Otherwis...

Radiation from monopole antennas on spherical-lossy earth is analyzed by the finitedifference time-domain (FDTD) method in spherical coordinates. A novel generalized perfectly matched layer (PML) has been developed for the truncation of the lossy soil. For having an accurate modeling with less memory requirements, an efficient "non-uniform" mesh generation scheme is used. Also in each time step...

Simulation of the electrical and optical response a multilayer thin film composed lossless material coupled with adjacent lossy in an alternating arrangement when applying transverse voltage across is conducted using polynomial approach. The modelling lossy–lossless generalization our previous work on made up lossy–lossy materials. It propagation matrix electromagnetic wave that governs its pro...

We consider the veriication of a class of innnite-state systems called lossy channel systems, which consist of nite-state processes communicating via unbounded but lossy FIFO channels. This class is able to model several interesting protocols, such as HDLC, the Alternating Bit Protocol, and other Sliding Window protocols. In earlier papers we have considered the decidability of various temporal...

Reversible integer wavelet transforms allow both lossless and lossy decoding using a single bitstream. We present a new fully scalable image coder and investigate the lossless and lossy performance of these transforms in the proposed coder. The lossless compression performance of the presented method is comparable to JPEG-LS. The lossy performance is quite competitive with other efficient lossy...

Injective one-way trapdoor functions are one of the most fundamental cryptographic primitives. In this work we show how to derandomize lossy encryption (with long messages) to obtain lossy trapdoor functions, and hence injective one-way trapdoor functions. Bellare, Halevi, Sahai and Vadhan (CRYPTO ’98) showed that if Enc is an IND-CPA secure cryptosystem, and H is a random oracle, then x 7→ Enc...

We put forward a generalization of lossy trapdoor functions (LTFs). Namely, all-but-many lossy trapdoor functions (ABM-LTFs) are LTFs that are parametrized with tags. Each tag can either be injective or lossy, which leads to an invertible or a lossy function. The interesting property of ABM-LTFs is that it is possible to generate an arbitrary number of lossy tags by means of a special trapdoor,...