English
Related papers

Related papers: Random Number Generator Attack against the Kirchho…

200 papers

A simple protocol which takes advantage of the inherent random times of detections in single photon counting modules is presented for random active basis choices when using entanglement-based protocols for Quantum Key Distribution (QKD). It…

The discrete-variable QKD protocols based on BB84 are known to be secure against an eavesdropper, Eve, intercepting the flying qubits and performing any quantum operation on them. However, these protocols may still be vulnerable to…

Quantum Physics · Physics 2018-05-02 Scott Vinay , Pieter Kok

In the case of the need of extraordinary security, Kirchhoff-loop-Johnson-(like)-noise ciphers can easily be integrated on existing types of digital chips in order to provide secure data communication between hardware processors, memory…

General Physics · Physics 2011-08-16 Laszlo B. Kish , Olivier Saidi

Unconditionally secure communication, being pursued for thousands of years, however, hasn't been reached yet due to continuous competitions between encryption and hacking. Quantum key distribution (QKD), harnessing the quantum mechanical…

Quantum Physics · Physics 2020-03-06 Xiao-Ling Pang , Ai-Lin Yang , Chao-Ni Zhang , Jian-Peng Dou , Hang Li , Jun Gao , Xian-Min Jin

We analyze the security of a quantum secure direct communication protocol equipped with authentication. We first propose a specifc attack on the protocol by which, an adversary can break the secret already shared between Alice and Bob, when…

Quantum Physics · Physics 2016-09-30 Ali Amerimehr , Massoud Hadian Dehkordi

The goal of two-party cryptography is to enable two parties, Alice and Bob, to solve common tasks without the need for mutual trust. Examples of such tasks are private access to a database, and secure identification. Quantum communication…

Quantum Physics · Physics 2016-05-10 Jędrzej Kaniewski , Stephanie Wehner

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…

Cryptography and Security · Computer Science 2024-01-31 Amir K. Khandani

The security of prepare-and-measure satellite-based quantum key distribution (QKD), under restricted eavesdropping scenarios, is addressed. We particularly consider cases where the eavesdropper, Eve, has limited access to the transmitted…

Quantum key distribution (QKD) can be used to generate secret keys between two distant parties. Even though QKD has been proven unconditionally secure against eavesdroppers with unlimited computation power, practical implementations of QKD…

Quantum Physics · Physics 2007-07-13 Chi-Hang Fred Fung , Bing Qi , Kiyoshi Tamaki , Hoi-Kwong Lo

We propose a quantum key distribution protocol based on a quantum retrodiction protocol, known as the Mean King problem. The protocol uses a two way quantum channel. We show security against coherent attacks in a transmission error free…

Quantum Physics · Physics 2010-04-01 A. H. Werner , T. Franz , R. F. Werner

We prove the security of the Bennett-Brassard (BB84) quantum key distribution protocol in the case where the source and detector are under the limited control of an adversary. Our proof applies when both the source and the detector have…

Quantum Physics · Physics 2007-05-23 Daniel Gottesman , Hoi-Kwong Lo , Norbert Lütkenhaus , John Preskill

Weak physical uncloneable function (WPUF) encryption key means that the manufacturer of the hardware can clone the key but anybody else is unable to so that. Strong physical uncloneable function (SPUF) encryption key means that even the…

Cryptography and Security · Computer Science 2013-12-18 Laszlo B. Kish , Chiman Kwan

Unconditional security of quantum key distribution protocol can be guaranteed by the basic property of quantum mechanics. Unfortunately, the practical quantum key distribution system always have some imperfections, and the practical system…

We give an entanglement assisted scheme for quantum key distribution. The scheme requires the maximally entangled 2-qubit state but does not require any quantum storage. The scheme is unconditionally secure under whatever Eve's attack.…

Quantum Physics · Physics 2016-09-08 Xiang-Bin Wang

In this letter, we concentrate on the very recently proposed Measurement Device Independent Quantum Key Distribution (MDI QKD) protocol by Lo, Curty and Qi (PRL, 2012). We study how one can suitably present an eavesdropping strategy on MDI…

Quantum Physics · Physics 2012-09-07 Arpita Maitra

Today's information society relies on cryptography to achieve security goals such as confidentiality, integrity, authentication, and non-repudiation for digital communications. Here, public-key cryptosystems play a pivotal role to share…

Cryptography and Security · Computer Science 2024-12-19 Paul Staat , Meik Dörpinghaus , Azadeh Sheikholeslami , Christof Paar , Gerhard Fettweis , Dennis Goeckel

From dice to modern complex circuits, there have been many attempts to build increasingly better devices to generate random numbers. Today, randomness is fundamental to security and cryptographic systems, as well as safeguarding privacy. A…

We devise a simple modification that essentially doubles the efficiency of a well-known quantum key distribution scheme proposed by Bennett and Brassard (BB84). Our scheme assigns significantly different probabilities for the different…

Quantum Physics · Physics 2007-05-23 M. Ardehali , H. F. Chau , Hoi-Kwong Lo

We propose a new scheme to enhance the physical-layer security of wireless single-input single-output orthogonal-frequency division-multiplexing (OFDM) transmissions from an electric vehicle, Alice, to the aggregator, Bob, in the presence…

Information Theory · Computer Science 2018-03-02 Ahmed El Shafie , Mohamed F. Marzban , Rakan Chabaan , Naofal Al-Dhahir

We study the role of interaction in the Common Randomness Generation (CRG) and Secret Key Generation (SKG) problems. In the CRG problem, two players, Alice and Bob, respectively get samples $X_1,X_2,\dots$ and $Y_1,Y_2,\dots$ with the pairs…

Information Theory · Computer Science 2018-08-28 Mitali Bafna , Badih Ghazi , Noah Golowich , Madhu Sudan