Related papers: Reply to Comment on "Exposed-key weakness of $\alp…

We consider the problem of constructing an unconditionally secure cipher for the case when the key length is less than the length of the encrypted message. (Unconditional security means that a computationally unbounded adversary cannot…

Here we explain how C. Tsallis' reply (Entropy 2021, 23(5), 630) fails to respond to points raised in (Entropy 2020, 22(10), 1110) and introduces further inconsistencies on the origin of black hole entropy. In his reply, Tsallis argues that…

Recently, Chou et al. [Electron Commer Res, DOI 10.1007/s10660-014-9143-6] presented a novel controlled quantum secure direct communication protocol which can be used for online shopping. The authors claimed that their protocol was immune…

Recently, a quantum key exchange protocol has been described, which served as basis for securing an actual bank transaction by means of quantum cryptography [quant-ph/0404115]. Here we show, that the authentication scheme applied is…

Hundreds of defenses have been proposed to make deep neural networks robust against minimal (adversarial) input perturbations. However, only a handful of these defenses held up their claims because correctly evaluating robustness is…

The so-called {\em leakage-chain rule} is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable $X$ in case the adversary who having already learned some random variables…

We prove that the inequality used recently by Wilk and W{\l}odarczyk [Phys. Rev. A {\bf 79}, 062108 (2009)] to find a better lower bound in the uncertainty relations for the R\'enyi entropies is invalid. Thus, the problem of improving the…

In a recent paper [Entropy 2020, 22(1), 17] C. Tsallis states that entropy -- as in Shannon's or Kullback-Leiber's definitions -- is inadequate to interpret black hole entropy and suggests that a new non-additive functional should take the…

We present full generalisations of entropic security and entropic indistinguishability to the quantum world where no assumption but a limit on the knowledge of the adversary is made. This limit is quantified using the quantum conditional…

We point out that arguments for the security of Kish's noise-based cryptographic protocol have relied on an unphysical no-wave limit, which if taken seriously would prevent any correlation from developing between the users. We introduce a…

Cryptographic key exchange protocols traditionally rely on computational conjectures such as the hardness of prime factorisation to provide security against eavesdropping attacks. Remarkably, quantum key distribution protocols like the one…

The quantum key distribution for multiparty is one of the essential subjects of study. Especially, without using entangled states, performing the quantum key distribution for multiparty is a critical area of research. For this purpose,…

A recent Letter by Wadhia et al. reports a realization of a quantum clock using a double quantum dot (DQD) [Phys. Rev. Lett. 135, 200407 (2005)]. This Comment identifies two fundamental issues: (I) the claimed ``quantum clock" exhibits only…

Measuring the vulnerability of communities in complex network has become an important topic in the research of complex system. Numerous existing vulnerability measures have been proposed to solve such problems, however, most of these…

We investigate entropy as a financial risk measure. Entropy explains the equity premium of securities and portfolios in a simpler way and, at the same time, with higher explanatory power than the beta parameter of the capital asset pricing…

Secure distributed data compression in the presence of an eavesdropper is explored. Two correlated sources that need to be reliably transmitted to a legitimate receiver are available at separate encoders. Noise-free, limited rate links from…

We consider the problem of secure distributed data storage under the paradigm of \emph{weak security}, in which no \emph{meaningful information} is leaked to the eavesdropper. More specifically, the eavesdropper cannot get any information…

NeuraCrypt (Yara et al. arXiv 2021) is an algorithm that converts a sensitive dataset to an encoded dataset so that (1) it is still possible to train machine learning models on the encoded data, but (2) an adversary who has access only to…

We analyze the security of two-way quantum key distribution using arbitrary finite-dimensional systems, considering both individual and collective eavesdropping attacks, without the effective use of entangled states, by incorporating two…

In this report we discuss the insecurity with present implementations of the Ekert protocol for quantum-key distribution based on the Wigner Inequality. We propose a modified version of this inequality which guarantees safe quantum-key…