Shannon information theoretic approach to perfect security requires equal number of key
bits to the information bits. This fact has been studied for decades and known as" Shannon …

Shannon showed that to achieve perfect secrecy in point-to-point communication, the
message rate cannot exceed the shared secret key rate giving rise to the simple one-time …

While information-theoretic security is stronger than computational security, it has long been
considered impractical. In this work, we provide new insights into the design of practical …

Shannon's fundamental bound for perfect secrecy says that the entropy of the secret
message U cannot be larger than the entropy of the secret key R shared by the sender and …

We study the rate of change of the multivariate mutual information among a set of random
variables when some common randomness is added to or removed from a subset. This is …

In this chapter, we first introduce entropy and some basic concepts related to information
theory. We show how entropy has find its way from thermodynamics into information theory …

We consider the Shannon cipher system with a variable key rate, and study the necessary
and sufficient conditions for perfect secrecy in the sense that the exponential rate of the …

Randomness plays a central role in computer science, in particular cryptography. Almost all
cryptographic primitives depend crucially on randomness because randomness and …

Perfect secrecy describes cases where an adversary cannot learn anything about the secret
beyond its prior distribution. A classical result by Shannon shows that a necessary condition …

We adopt L1 distance as Eve's distinguishability in secret key generation from a common
random number without communication. Under this secrecy criterion, using the Rényi …