Efficient arbitrated quantum signature scheme without entangled states

2019 ◽  
Vol 34 (21) ◽  
pp. 1950166 ◽  
Author(s):  
Xiangjun Xin ◽  
Qianqian He ◽  
Zhuo Wang ◽  
Qinglan Yang ◽  
Fagen Li

In the most arbitrated quantum signatures (AQSs), the signers and verifiers need to perform the quantum key distribution protocols or some other protocols to share secret keys before signing a signature. In some schemes, the entangle states, which are not easily implemented, have to be prepared and distributed among the partners. Based on single photon and one-way functions, a new AQS scheme without entangled states is proposed. In our scheme, the signer generates a quantum signature on the classical message with his/her private key and the one-way function. The arbitrator communicates with the signer through a classical unencrypted channel. The signer and verifier need not perform the key distribution protocol before signing a message. On the other hand, without entangled states, our scheme can reduce the complexity of implementation. Then, our scheme is more efficient than the similar schemes. At the same time, our scheme is secure against forgery attack and disavowal attack.

2019 ◽  
Vol 34 (34) ◽  
pp. 1950281 ◽  
Author(s):  
Chia-Wei Tsai ◽  
Chun-Wei Yang ◽  
Narn-Yih Lee

Classical users can share a secret key with a quantum user by using a semi-quantum key distribution (SQKD) protocol. Allowing two classical users to share a secret key is the objective of the mediated semi-quantum key distribution (MSQKD) protocol. However, the existing MSQKD protocols need a quantum user to assist two classical users in distributing the secret keys, and these protocols require that the classical users be equipped with a Trojan horse photon detector. This reduces the practicability of the MSQKD protocols. Therefore, in this study we propose a lightweight MSQKD, in which the two participants and third party are classical users. Due to the usage of the one-way transmission strategy, the proposed lightweight MSQKD protocol is free from quantum Trojan horse attack. The proposed MSQKD is more practical than the existing MSQKD protocols.


2005 ◽  
Vol 03 (supp01) ◽  
pp. 75-86
Author(s):  
MASATO KOASHI

In the BB84 protocol with a perfect single photon source, the key rate decreases linearly with the transmission η of the channel. If we simply replace this source with a weak coherent-state pulse, the key rate drops more rapidly (as O(η2)) since the presence of multiple photons favors the eavesdropper. Here we discuss the unconditional security of a quantum key distribution protocol in which bit values are encoded in the phase of a weak coherent-state pulse relative to a strong reference pulse, which is essentially the one proposed by Bennett in 1992 (the B92 scheme). We show that in the limit of high loss in the transmission channel, we can construct a secret key with a rate proportional to the transmission η of the channel.


2021 ◽  
Vol 12 (1) ◽  
Author(s):  
René Schwonnek ◽  
Koon Tong Goh ◽  
Ignatius W. Primaatmaja ◽  
Ernest Y.-Z. Tan ◽  
Ramona Wolf ◽  
...  

AbstractDevice-independent quantum key distribution (DIQKD) is the art of using untrusted devices to distribute secret keys in an insecure network. It thus represents the ultimate form of cryptography, offering not only information-theoretic security against channel attacks, but also against attacks exploiting implementation loopholes. In recent years, much progress has been made towards realising the first DIQKD experiments, but current proposals are just out of reach of today’s loophole-free Bell experiments. Here, we significantly narrow the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. By using two randomly chosen key generating bases instead of one, we show that our protocol significantly improves over the original DIQKD protocol, enabling positive keys in the high noise regime for the first time. We also compute the finite-key security of the protocol for general attacks, showing that approximately 108–1010 measurement rounds are needed to achieve positive rates using state-of-the-art experimental parameters. Our proposed DIQKD protocol thus represents a highly promising path towards the first realisation of DIQKD in practice.


2007 ◽  
Vol 1 (6) ◽  
pp. 343-348 ◽  
Author(s):  
Hiroki Takesue ◽  
Sae Woo Nam ◽  
Qiang Zhang ◽  
Robert H. Hadfield ◽  
Toshimori Honjo ◽  
...  

2014 ◽  
Vol 33 ◽  
pp. 1460361 ◽  
Author(s):  
Lachlan J. Gunn ◽  
James M. Chappell ◽  
Andrew Allison ◽  
Derek Abbott

While information-theoretic security is often associated with the one-time pad and quantum key distribution, noisy transport media leave room for classical techniques and even covert operation. Transit times across the public internet exhibit a degree of randomness, and cannot be determined noiselessly by an eavesdropper. We demonstrate the use of these measurements for information-theoretically secure communication over the public internet.


2021 ◽  
Author(s):  
Mircea-Adrian Digulescu

It has long been known that cryptographic schemes offering provably unbreakable security exist, namely the One Time Pad (OTP). The OTP, however, comes at the cost of a very long secret key - as long as the plain-text itself. In this paper we propose an encryption scheme which we (boldly) claim offers the same level of security as the OTP, while allowing for much shorter keys, of size polylogarithmic in the computing power available to the adversary. The Scheme requires a large sequence of truly random words, of length polynomial in the both plain-text size and the logarithm of the computing power the adversary has. We claim that it ensures such an attacker cannot discern the cipher output from random data, except with small probability. We also show how it can be adapted to allow for several plain-texts to be encrypted in the same cipher output, with almost independent keys. Also, we describe how it can be used in lieu of a One Way Function.


Sign in / Sign up

Export Citation Format

Share Document