After being introduced by Shannon as a measure of disorder and unavailable information,
the notion of entropy has found its applications in a broad range of scientific disciplines. In …

Common information is ubiquitous in information theory and related areas such as
theoretical computer science and discrete probability. However, because there are multiple …

In this paper we give improved constructions of several central objects in the literature of
randomness extraction and tamper-resilient cryptography. Our main results are:(1) An …

Randomness extractors and error correcting codes are fundamental objects in computer
science. Recently, there have been several natural generalizations of these objects, in the …

In this work we provide a traitor tracing construction with ciphertexts that grow polynomially
in log (n) where n is the number of users and prove it secure under the Learning with Errors …

This paper addresses deterministic public-key encryption schemes (DE), which are
designed to provide meaningful security when only source of randomness in the encryption …

We present new constructions of leakage-resilient cryptosystems, which remain provably
secure even if the attacker learns some arbitrary partial information about their internal …

In this paper, information theoretic cryptography is discussed based on conditional Rényi
entropies. Our discussion focuses not only on cryptography but also on the definitions of …

We introduce a method for obtaining provable polynomial time solutions of problems in
nonabelian algebraic cryptography. This method is widely applicable, easier to apply, and …

The conventional channel resolvability problem refers to the determination of the minimum
rate required for an input process so that the output distribution approximates a target …