In many multimedia applications, there is a need to authenticate a source that has been subjected to benign degradations in addition to potential tampering attacks. We develop a meaningful formulation of this problem, and identify and interpret the associated information-theoretic performance limits. The associated systems are shown to perform dramatically better than frequently proposed approa...

In this essay we present an information-theoretic perspective on epistemology using software models. We shall use the notion of algorithmic information to discuss what is a physical law, to determine the limits of the axiomatic method, and to analyze Darwin’s theory of evolution. Weyl, Leibniz, complexity and the principle of

Clifton, Bub, and Halvorson [Foundations of Physics 33, 1561– 1591, (2003)] have recently argued that quantum theory is characterized by its satisfaction of three information-theoretic axioms. However, it is not difficult to construct apparent counterexamples to the CBH characterization theorem. In this paper, we discuss the limits of the characterization theorem, and we provide some technical ...

We prove the rst general and non-trivial lower bound for the number of times a 1-out-of-n Oblivious Transfer of strings of length`should be invoked so as to obtain, by an information-theoretically secure reduction, a 1-out-of-N Oblivious Transfer of strings of length L. Our bound is tight in many signiicant cases. We also prove the rst non-trivial lower bound for the number of random bits neede...