Improved Schemes for Visual Cryptography

A (k,n)-threshold visual cryptography scheme ((k,n)-threshold VCS, for short) is a method to encode a secret image SI into n shadow images called shares such that any k or more shares enable the visual recovery of the secret image, but by inspecting less than k shares one cannot gain any information on the secret image. The visual recovery consists of xeroxing the shares onto transparencies, and then stacking them. Any k shares will reveal the secret image without any cryptographic computation.In this paper we analyze visual cryptography schemes in which the reconstruction of black pixels is perfect, that is, all the subpixels associated to a black pixel are black. For any value of k and n, where 2 k n, we give a construction for (k,n)-threshold VCS which improves on the best previously known constructions with respect to the pixel expansion (i.e., the number of subpixels each pixel of the original image is encoded into). We also provide a construction for coloured (2,n)-threshold VCS and for coloured (n,n)-threshold VCS. Both constructions improve on the best previously known constructions with respect to the pixel expansion.     

Optimal Colored Threshold Visual Cryptography Schemes

Visual cryptography schemes allow the encoding of a secret image into n shares which are distributed to the participants. The shares are such that only qualified subsets of participants can visually recover the secret image. Usually the secret image consist of black and white pixels. In colored threshold visual cryptography schemes the secret image is composed of pixels taken from a given set of c colors. The pixels expansion and the contrast of a scheme are two measures of the goodness of the scheme.In this paper, we study c-color (k,n)-threshold visual cryptography schemes and provide a characterization of contrast-optimal schemes. More specifically we prove that there exists a contrast-optimal scheme that is a member of a special set of schemes, which we call canonical schemes, and that satisfy strong symmetry properties.Then we use canonical schemes to provide a constructive proof of optimality, with respect to the pixel expansion, of c-color (n,n)-threshold visual cryptography schemes.Finally, we provide constructions of c-color (2,n)-threshold schemes whose pixels expansion improves on previously proposed schemes.*This author is also a member of the Akamai Faculty Group, Akamai Technologies, 8 Cambridge center, Cambridge, MA 02142, USA.     

Sharpening of Stečkin's theorem to strong approximation with exponentp

— , B _n , B p1., , p=1 , - . , , , p.     

Transferring estimates for zonal convolution operators

_p - , . Ad- .     

Жизнь и деятельность яноша Бояи

: . BOLYAI.     

On the divergence of spherical sums of double Fourier-Haar series

. : [0, +) [0, +) - , u+ (u) (u)=o(u lnu). [0, 1]² f , ¦f¦ L([0, 1]²), - [0, 1]².     

Discretization with interpolating approximation

.     

Замечания об ихтерполировании

.      

О Сходимости метода подобластей

.      

О предельном распределении для сумм независимых слууайных велиуин на бикомпактных коммутативных топологиуеских группах

,      

Symmetrization of functions in Sobolev spaces and the isoperimetric inequality

A positive measurable function f on R^d can be symmetrized to a function f^* depending only on the distance r, and with the same distribution function as f. If the distribution derivatives of f are Radon measures then we have the inequality f^*f, where f is the total mass of the gradient. This inequality is a generalisation of the classical isoperimetric inequality for sets. Furthermore, and this is important for applications, if f belongs to the Sobolev space H¹,P then f^* belongs to H¹,P and f^*_pf_p.     

Maximal inequalities,convexity inequality,and their duality. II

, , . . . [1], , . , , ., , L logL. , , . . . . [5]. , .     

Mixed-norm estimates for a class of integral operators

(, ) — R ^m ×R ⁿ . f R ^m ×R ⁿ f_p,q, f L _p (R ^m) x y, L^q(Rⁿ). ׃ _q,r cƒ _p,r , ׃ R ^m ×R ⁿ , , , q r . , ( ¦¦) K ₀ (y); p, g r , K ₀.     

Characterization of regular singular linear systems of difference equations

This paper deals with linear systems of difference equations whose coefficients admit generalized factorial series representations atz=. We are concerned with the behavior of solutions near the pointz= (the only fixed singularity for difference equations). It is important to know whether a system of linear difference equations has a regular singularity or an irregular singularity. To a given system () we can assign a number , called the Moser's invariant of (), so that the system is regular singular if and only if 1. We shall develop an algorithm, implementable in a computer algebra system, which reduces in a finite number of steps the system of difference equations to an irreducible form. The computation ot the number can be done explicitly from this irreducible form.     

On the Continuity of Pathwise Solutions to Langevin Equations in Infinite Dimensions

We fix a rich probability space (,F,P). Let (H,) be a separable Hilbert space and let be the canonical cylindrical Gaussian measure on H. Given any abstract Wiener space (H,B,) over H, and for every Hilbert–Schmidt operator T: HBH which is (|{}|,)-continuous, where |{}| stands for the (Gross-measurable) norm on B, we construct an Ornstein–Uhlenbeck process : (,F,P)×[0,1](B,|{}|) as a pathwise solution of the following infinite-dimensional Langevin equation d _t =db _t +T( _t )dt with the initial data ₀=0, where b is a B-valued Brownian motion based on the abstract Wiener space (H,B,). The richness of the probability space (,F,P) then implies the following consequences: the probability space is independent of the abstract Wiener space (H,B,) (in the sense that (,F,P) does not depend on the choice of the Gross-measurable norm |{}|) and the space C _B consisting of all continuous B-valued functions on [0,1] is identical with the set of all paths of . Finally, we present a way to obtain pathwise continuous solutions :d _t =

Morera type theorems on the unit disc

, . . : , , , , .     

On the asymptotic distribution of oscillation points in rational approximation

. . ( ) , , (m) (m)m, n(m) ^* ) ( d(m) — r _{m, n(m)} ^*) )/ , .

---

---

The paper was written during the second author's visit at the Mathematical Institute of the Hungarian Academy of Sciences.     

О лагранжевом интерполировании с узлами в корнях многочленов сонина-маркова

.      

Compact elements in the lattice of radicals

Summary A radical R, in the sense of Kurosh--Amitsur, is said to be compact if, given any collection of radicals X such that R ≤;VX, we have R ≤;VX' for some finite subcollection X' of X. A ring A is said to be radical compact if the lower radical on the singleton {A} is compact. This paper explores the relationship between radical compact rings and rings satisfying certain finiteness conditions. Closure properties of the class of all radical compact rings are also investigated.     

Extremes of a Gaussian Process and the Constant H α

Consider a triangular array of standard Gaussian random variables {_n,i, i 0, n 1} such that {_n,i, i 0} is a stationary normal sequence for each n 1. Let _n,k = corr(_n,i,_n,i+k). If (1-_n,k)log n _k (0,) as n for some k, then the locations where the extreme values occur cluster and the limiting distribution of the maxima is still the Gumbel distribution as in the stationary or i.i.d. case, but shifted by a parameter measuring the clustering. Triangular arrays of Gaussian sequences are used to approximate a continuous Gaussian process X(t), t 0. The cluster behavior of the random sequence refers to the behavior of the extremes values of the continuous process. The relation is analyzed. It reveals a new definition of the constants H used for the limiting distribution of maxima of continuous Gaussian processes and provides further understanding of the limit result for these extremes.