Related papers: Repeatable classical one-time-pad crypto-system wi…

We report the security analysis of time-coding quantum key distribution protocols. The protocols make use of coherent single-photon pulses. The key is encoded in the photon time-detection. The use of coherent superposition of states allows…

Quantum data locking is a unique quantum phenomenon that allows a relatively short key to (un)lock an arbitrarily long message encoded in a quantum state, in such a way that an eavesdropper who measures the state but does not know the key…

Can a sender non-interactively transmit one of two strings to a receiver without knowing which string was received? Does there exist minimally-interactive secure multiparty computation that only makes (black-box) use of symmetric-key…

Quantum public-key encryption (PKE), where public-keys and/or ciphertexts can be quantum states, is an important primitive in quantum cryptography. Unlike classical PKE (e.g., RSA or ECC), quantum PKE can leverage quantum-secure…

We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large class of efficient classical public-coin protocols can be…

It had been widely claimed that quantum mechanics can protect private information during public decision in for example the so-called two-party secure computation. If this were the case, quantum smart-cards could prevent fake teller…

Quantum communication employs the counter-intuitive features of quantum physics to perform tasks that are im- possible in the classical world. It is crucial for testing the foundations of quantum theory and promises to rev- olutionize our…

We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental…

This article bridges the gap between two topics used in sharing an encryption key: (i) Key Consolidation, i.e., extracting two identical strings of bits from two information sources with similarities (common randomness). (ii) Quantum-safe…

In 1949, Shannon proved the perfect secrecy of the Vernam cryptographic system,also popularly known as the One-Time Pad (OTP). Since then, it has been believed that the perfectly random and uncompressible OTP which is transmitted needs to…

We propose to analyse quantum protocols by applying formal verification techniques developed in classical computing for the analysis of communicating concurrent systems. One area of successful application of these techniques is that of…

Recently, Zhang et al. proposed a single-state semi-quantum key distribution protocol (Int. J. Quantum Inf, 18, 4, 2020) to help a quantum participant to share a secret key with a classical participant. However, this study shows that an…

The advantages of post-quantum cryptography over classical cryptography are covered in this survey. We address several post-quantum cryptography techniques. We conclude that the deployment of quantum-safe cryptographic systems is…

Recently, Chau introduced an experimentally feasible qudit-based quantum-key-distribution (QKD) scheme. In that scheme, one bit of information is phase encoded in the prepared state in a $2^n$-dimensional Hilbert space in the form…

In this short note, we improve and extend Yao's paper "On the power of quantum fingerprinting" about simulating a classical public coin simultaneous message protocol by a quantum simultaneous message protocol with no shared resource.

Within the framework of quantum memory channels we introduce the notion of repeatability of quantum channels. In particular, a quantum channel is called repeatable if there exist a memory device implementing the same channel on each…

It has been pointed out that current protocols for device independent quantum key distribution can leak key to the adversary when devices are used repeatedly and that this issue has not been addressed. We introduce the notion of an…

The feasibility of trust-free long-haul quantum key distribution (QKD) networks is addressed. We combine measurement-device-independent QKD (MDI-QKD), as an access technology, with a quantum repeater setup, at the core of future quantum…

One-way functions are fundamental to classical cryptography and their existence remains a longstanding problem in computational complexity theory. Recently, a provable quantum one-way function has been identified, which maintains its…

A new quantum cryptography implementation is presented that combines one-way operation with an autocompensating feature that has hitherto only been available in implementations that require the signal to make a round trip between the users.…