Perfectly-secure cryptography is a branch of information-theoretic cryptography. A perfectly-
secure cryptosystem guarantees that the malicious third party cannot guess anything …

Perfectly secure cryptography is a branch of information-theoretic cryptography. A perfectly
secure cryptosystem guarantees that the malicious third party cannot guess anything …

This chapter discusses the reason why we have chosen to study perfectly secure
cryptography (as a branch of information-theoretic cryptography) among the existing …

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 …

In this chapter, we first overview the applications of combinatorics in cryptography. Then, we
take look at some historical applications of non-combinatorial squares and cubes in …

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 …

ICITS 2012 was the 6th International Conference of Information-theoretic Security, held at
the Université de Montréal in Montreal, Quebec, Canada, during August 15–17, 2012. ICITS …

Typically, when secrecy multiplication is performed in multiparty computation using Shamir's
(k, n) threshold secret sharing scheme, the result is a polynomial with degree of 2k-2 instead …

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 …

This volume contains the papers presented at Inscrypt 2014: The 10th China International
Conference on Information Security and Cryptology held during December 13–15, 2014 in …