The Adversarial Robustness of Sampling

Random sampling is a fundamental primitive in modern algorithms, statistics, and machine learning, used as a generic method to obtain a small yet "representative" subset of the data. In this work, we investigate the robustness of sampling against adaptive adversarial attacks in a streaming setting: An adversary sends a stream of elements from a universe $U$ to a sampling algorithm (e.g., Bernoulli sampling or reservoir sampling), with the goal of making the sample "very unrepresentative" of the underlying data stream. The adversary is fully adaptive in the sense that it knows the exact content of the sample at any given point along the stream, and can choose which element to send next accordingly, in an online manner. Well-known results in the static setting indicate that if the full stream is chosen in advance (non-adaptively), then a random sample of size $\Omega(d / \varepsilon^2)$ is an $\varepsilon$-approximation of the full data with good probability, where $d$ is the VC-dimension of the underlying set system $(U,R)$. Does this sample size suffice for robustness against an adaptive adversary? The simplistic answer is \emph{negative}: We demonstrate a set system where a constant sample size (corresponding to VC-dimension $1$) suffices in the static setting, yet an adaptive adversary can make the sample very unrepresentative, as long as the sample size is (strongly) sublinear in the stream length, using a simple and easy-to-implement attack. However, this attack is "theoretical only", requiring the set system size to (essentially) be exponential in the stream length. This is not a coincidence: We show that to make Bernoulli or reservoir sampling robust against adaptive adversaries, the modification required is solely to replace the VC-dimension term $d$ in the sample size with the cardinality term $\log |R|$. This nearly matches the bound imposed by the attack

Non-Malleable Secret Sharing for General Access Structures

Goyal and Kumar (STOC\u2718) recently introduced the notion of non-malleable secret sharing. Very roughly, the guarantee they seek is the following: the adversary may potentially tamper with all of the shares, and still, either the reconstruction procedure outputs the original secret, or, the original secret is ``destroyed and the reconstruction outputs a string which is completely ``unrelated to the original secret. Prior works on non-malleable codes in the 2 split-state model imply constructions which can be seen as 2-out-of-2 non-malleable secret sharing (NMSS) schemes. Goyal and Kumar proposed constructions of t-out-of-n NMSS schemes. These constructions have already been shown to have a number of applications in cryptography. We continue this line of research and construct NMSS for more general access structures. We give a generic compiler that converts any statistical (resp. computational) secret sharing scheme realizing any access structure into another statistical (resp. computational) secret sharing scheme that not only realizes the same access structure but also ensures statistical non-malleability against a computationally unbounded adversary who tampers each of the shares arbitrarily and independently. Instantiating with known schemes we get unconditional NMMS schemes that realize any access structures generated by polynomial size monotone span programs. Similarly, we also obtain conditional NMMS schemes realizing access structure in monotoneP (resp. monotoneNP) assuming one-way functions (resp. witness encryption). Towards considering more general tampering models, we also propose a construction of n-out-of-n NMSS. Our construction is secure even if the adversary could divide the shares into any two (possibly overlapping) subsets and then arbitrarily tamper the shares in each subset. Our construction is based on a property of inner product and an observation that the inner-product based construction of Aggarwal, Dodis and Lovett (STOC\u2714) is in fact secure against a tampering class that is stronger than 2 split-states. We also show applications of our construction to the problem of non-malleable message transmission

Hierarchical Interpretation of Fractal Image Coding and Its Applications

The basics of a block oriented fractal image coder are reviewed. The output of the coder is an IFS (Iterated Function System), which approximates the image as a fixed point of a contractive transformation. A new hierarchical interpretation of the IFS code, which relates the different scales of the fixed point, is introduced. We prove the existence of a unique function of a continuous variable that is associated with the IFS code. It is further shown that the different scales of the IFS fixed point are directly computable from this so called IFS embedded function. The computation of the IFS-code, depends on the sampling method, an issue that is also discussed. A matrix representation of the IFS code is described and related to the fractal dimension of the IFS embedded function. An application to a new super-resolution method, using an IFS-code, is demonstrated, and its characteristics are analyzed. Another application of the hierarchical representation to fast decoding is also presented..

A Multi-Resolution Framework for Fractal Image Representation and its applications

The starting point of this paper is the basic fractal coder suggested by Jacquin. The coder finds and encodes the parameters of a partitioned iterated function system (PIFS), which approximates the signal as a fixed-point of a contractive transformation. The work presented here can be divided into two parts. The first part begins with a presentation of the hierarchical structure of the PIFS code. This structure relates the code and its fixed-point in different resolutions. It is shown that there exists a function of a continuous variable which is directly related to the PIFS. It is shown that by properly manipulating this function, called the PIFS embedded-function, one can compute the fixed-points related to the code in any desired resolution. We end the first part with a brief description of several applications, such as a fast non-iterative decoder, a method for fractal interpolation of the signal via its PIFS code, and an improved collage-bound. This research was supported by the ..