The discrete logarithm problem (DLP) is the basis for several cryptographic primitives. Since Shor’s work, it has been known that the DLP can be solved by combining a polynomial-size quantum circuit and a polynomial-time classical postprocessing algorithm. The theoretical result corresponds the situation where a quantum device working with a medium number of qubits of […]
The quantum key distribution (QKD) network with Vernam’s one-time pad encryption and secret sharing are powerful security tools to realize an information theoretically secure (ITS) distributed storage system. In the work of Fujiwara et al., a single-password-authenticated secret sharing (SPSS) scheme based on the QKD network and Shamirs secret sharing was experimentally demonstrated; it confirmed ITS […]
Recently, in Asiacrypt 2019, Bonnetain et al. have shown attacks by quantum adversaries on FX construction and Even-Mansour Cipher without using superposition queries to the encryption oracle. In this article, we use a similar approach to mount new attacks on Hash-Counter (HCTR) and Hash-Counter-Hash (HCH) constructions. In addition, we mount attacks on HCTR, tweakable-HCTR, and […]
Quantum key distribution (QKD) provides a potent solution to securely distribute keys for two parties. However, QKD itself is vulnerable to denial of service (DoS) attacks. A flexible and resilient QKD-enabled networked microgrids (NMs) architecture is needed but does not yet exist. In this article, we present a programmable quantum NMs (PQNMs) architecture. It is […]
A semiquantum key distribution (SQKD) protocol allows two users, one of whom is restricted in their quantum capabilities to being nearly classical, to establish a shared secret key, secure against an all-powerful adversary. The study of such protocols helps to answer the fundamental question of “how quantum” must a protocol be to gain an advantage […]