Nowadays, Internet of Things (IoT) devices are rapidly proliferating to support a vast number
of end-to-end (E2E) services and applications, which require reliable device authentication …

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 …

In this paper, we concretely formulate to derive the attacker's success probability of obtaining
the shared secret keys for the Y00 protocol under a combination of a quantum collective …

Although quantum key distribution is regarded as promising secure communication, security
of Y00 protocol proposed by Yuen in 2000 for the affinity to conventional optical …

Abstract Information theoretic cryptography is discussed based on conditional Rényi
entropies. Our discussion focuses not only on cryptography but also on the definitions of …

Universal hash functions map the output of a source to random strings over a finite alphabet,
aiming to approximate the uniform distribution on the set of strings. A classic result on these …

Fundamental results on secret sharing schemes (SSSs) are discussed in the setting where
security and share size are measured by (conditional) min-entropies. We first formalize a …

Different security notions of secret sharing schemes have been proposed by different
information measures. Entropies, such as Shannon entropy and min entropy, are frequently …

The trace distance criterion for security of Quantum Key Distribution (QKD) has been widely
perceived that its upperbound is the maximum failure probability in distributing an ideal …

In ideality, cryptographic primitives take for granted that the secret sources are derived from
uniform distribution. However, in reality, we may only obtain some 'weak'random sources …