TL;DR
A broader source-family view of information-theoretic semantic security is yielded, showing that short-key TDSS is possible for any family of sources with bounded second-order Rényi divergence from a common reference distribution.
The results guarantee security against fixed-target forgery under a single-signature-exposure model under the assumption of a finite supply of quadratic-stabilizer public-key states over an odd-prime field.
We study a protocol-level reaction leakage in CKKS deployments where public coefficient-to-slot (C2S) evaluation keys are combined with a client's 1-bit validity response. Under this deployment surface, a malicious evaluator can recover a ternary secret key using asymptotically optimal $O(H)$ reaction queries, where $H...
The amount of secret key that can be obtained from a quantum key distribution run depends on both the physically observed error rates and the mathematical bounds used to certify security. For finite datasets, conservative bounds force users to discard a substantial fraction of the potentially available key. Here we fur...
Quantum Key Distribution (QKD) protocols typically involve two separate steps of error-verification and privacy amplification. Both steps involve the application of a hash function sampled from a suitable hash family to classical data. A potentially simpler alternative is to implement a single-step hashing procedure, a...
It is shown that in a BIKE multi-instance setting an attacker can construct a DOOM instance with nM syndromes, and multi-instance security of code-based KEMs degrades as a function of M.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
