In a digital signature scheme with message recovery, rather than transmitting the message m and its signature σ, a single enhanced signature τ is transmitted. The verifier is able to recover m from τ and at the same time verify its authenticity. The two most important parameters of such a scheme are its security and overhead |τ | − |m|. A simple argument shows that for any scheme with “n bits s...

The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary’s algorithm as a black-box. We present the first constructions of non-black-box simulators. Using these new non-black-box techniques we o...

We consider sets Γ(n, s, k) of narrow clauses expressing that no definition of a size s circuit with n inputs is refutable in resolution R in k steps. We show that every CNF shortly refutable in Extended R, ER, can be easily reduced to an instance of Γ(0, s, k) (with s, k depending on the size of the ER-refutation) and, in particular, that Γ(0, s, k) when interpreted as a relativized NP search ...

We investigate the relative power of the common random string model vs. the private random string model in communication complexity. We show that the two model are essentially equal. Communication complexity is a model of computation where two parties, each with an input, want to mutually compute a Boolean function that is deened on pairs of inputs. Formally, let f : X Y 7 ! f0; 1g be a Boolean...

Psychophysical and neurophysiological evidence about the human visual system shows the existence of a mechanism, called surround suppression, which inhibits the response of an edge in the presence of other similar edges in the surroundings. A simple computational model of this phenomenon has been previously proposed by us, by introducing an inhibition term that is supposed to be high on texture...

This paper focuses on a fundamental input parameter for most existing mathematical models of pandemic influenza, the ‘basic reproductive number R0,’ defined to be the mean number of new influenza infections created by a newly infected person in a population of all susceptible people. We argue that R0 is limited in policy and scientific value as is any single parameter attempting to characterize...

We consider the problem of constructing efficient locally decodable codes in the presence of a computationally bounded adversary. Assuming the existence of one-way functions, we construct efficient locally decodable codes with positive information rate and low (almost optimal) query complexity which can correctly decode any given bit of the message from constant channel error rate ρ. This compa...

In this paper, we utilized Hidden Markov Model (HMM) as a mapping mechanism between two different kinds of correlated signals. Specifically, we developed a voicedriven talking head system by exploiting the physical relationships between the shape of the mouth and the sound that is produced. The proposed system can be easily trained and a talking head can be efficiently animated. In the training...

This study presents the effect of porosity on mechanical behaviors of a power distribution functionally graded beam. The Euler-Bernoulli beam is assumed to describe the kinematic relations and constitutive equations. Because of technical problems, particle size shapes and micro-voids are created during the fabrication which should be taken into consideration. Two porosity models are proposed. T...

A mode-constrained corpus-based synthesis strategy was developed for fundamental frequency (F0) contours of Japanese sentences. In the training phase, the relationship between linguistic factors and the command values (amplitudes and locations) of F0 contour generation process model was learned for a prediction module; a neural network in the current paper. Input parameters consist of linguisti...