Arbitration quantum signature protocol based on XOR encryption

2020 ◽  
Vol 18 (05) ◽  
pp. 2050025
Author(s):  
Xiao-Yi Zheng ◽  
Chang Kuang
Keyword(s):  
Quantum Mechanics ◽  
Quantum Information ◽  
Quantum Cryptography ◽  
Security Analysis ◽  
Quantum Signature ◽  
Ghz State ◽  
Basic Principles ◽  
Encryption Method ◽  
Design Ideas ◽  
Chain Type

Quantum signature is a branch of quantum cryptography that draws on the design ideas of classic digital signatures, and uses the basic principles of quantum mechanics to achieve the integrity, authenticity and nonrepudiation of quantum information. Among them, arbitration quantum signature (AQS) plays a very important role. In this paper, we proposed an AQS protocol based on XOR encryption. Unlike other protocols, a quantum one-time pad encryption method or chain-type CNOT encryption method is abandoned. The proposed protocol is designed based on the three-particle GHZ state combined with the idea of classical XOR encryption, with CNOT operations used to encrypt quantum messages and quantum signatures. A security analysis of the proposed protocol reveals that the proposed protocol can satisfy the AQS requirements of unforgeability and nonrepudiation.

QUANTA, CIPHERS AND COMPUTERS

COSMOS ◽  
2006 ◽  
Vol 02 (01) ◽  
pp. 1-20 ◽  
Author(s):  
ARTUR EKERT ◽  
L. C. KWEK ◽  
ANTIA LAMAS LINARES
Keyword(s):  
Information Theory ◽  
Quantum Mechanics ◽  
Quantum Information ◽  
Quantum Cryptography ◽  
Logic Gates ◽  
Quantum Information Theory ◽  
Atomic Scale ◽  
Quantum Bits ◽  
Silicon Chips ◽  
Quantum Technology

On the atomic scale, matter obeys the rules of quantum mechanics which are quite different from the classical rules that determine the properties of conventional computers. Today's advanced lithographic techniques can etch logic gates and wires less than a micron across onto the surfaces of silicon chips. Soon they will yield even smaller parts and inevitably reach a point where logic gates are so small that they are made out of only a handful of atoms. So, if computers are to become smaller in the future, new, quantum technology must replace or supplement what we have now. This article provides a grand overview of quantum information theory from the concept of quantum bits (qubits) to entanglement to quantum computation to quantum cryptography.

scholarly journals Multiparty weighted threshold quantum secret sharing based on the Chinese remainder theorem to share quantum information

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yao-Hsin Chou ◽  
Guo-Jyun Zeng ◽  
Xing-Yu Chen ◽  
Shu-Yu Kuo
Keyword(s):  
Quantum Information ◽  
Phase Shift ◽  
Quantum State ◽  
Secret Sharing ◽  
Chinese Remainder Theorem ◽  
Security Analysis ◽  
Quantum Secret Sharing ◽  
Security Protocol ◽  
Multiple Quantum ◽  
Cryptographic Primitive

AbstractSecret sharing is a widely-used security protocol and cryptographic primitive in which all people cooperate to restore encrypted information. The characteristics of a quantum field guarantee the security of information; therefore, many researchers are interested in quantum cryptography and quantum secret sharing (QSS) is an important research topic. However, most traditional QSS methods are complex and difficult to implement. In addition, most traditional QSS schemes share classical information, not quantum information which makes them inefficient to transfer and share information. In a weighted threshold QSS method, each participant has each own weight, but assigning weights usually costs multiple quantum states. Quantum state consumption will therefore increase with the weight. It is inefficient and difficult, and therefore not able to successfully build a suitable agreement. The proposed method is the first attempt to build multiparty weighted threshold QSS method using single quantum particles combine with the Chinese remainder theorem (CRT) and phase shift operation. The proposed scheme allows each participant has its own weight and the dealer can encode a quantum state with the phase shift operation. The dividing and recovery characteristics of CRT offer a simple approach to distribute partial keys. The reversibility of phase shift operation can encode and decode the secret. The proposed weighted threshold QSS scheme presents the security analysis of external attacks and internal attacks. Furthermore, the efficiency analysis shows that our method is more efficient, flexible, and simpler to implement than traditional methods.

scholarly journals Beyond Causal Explanation: Einstein’s Principle Not Reichenbach’s

Entropy ◽  
2021 ◽  
Vol 23 (1) ◽  
pp. 114
Author(s):  
Michael Silberstein ◽  
William Mark Stuckey ◽  
Timothy McDevitt
Keyword(s):  
Quantum Mechanics ◽  
Quantum Information ◽  
Causal Explanation ◽  
Causal Structure ◽  
Minkowski Spacetime ◽  
Physical Principle ◽  
Causal Principle ◽  
Complete Rejection ◽  
Epr Correlations ◽  
Tsirelson Bound

Our account provides a local, realist and fully non-causal principle explanation for EPR correlations, contextuality, no-signalling, and the Tsirelson bound. Indeed, the account herein is fully consistent with the causal structure of Minkowski spacetime. We argue that retrocausal accounts of quantum mechanics are problematic precisely because they do not fully transcend the assumption that causal or constructive explanation must always be fundamental. Unlike retrocausal accounts, our principle explanation is a complete rejection of Reichenbach’s Principle. Furthermore, we will argue that the basis for our principle account of quantum mechanics is the physical principle sought by quantum information theorists for their reconstructions of quantum mechanics. Finally, we explain why our account is both fully realist and psi-epistemic.

scholarly journals An Effective Framework for Chaotic Image Encryption Based on 3D Logistic Map

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Guodong Ye ◽  
Kaixin Jiao ◽  
Chen Pan ◽  
Xiaoling Huang
Keyword(s):  
Chaotic Map ◽  
Logistic Map ◽  
Security Analysis ◽  
Three Dimensional ◽  
Ecg Signal ◽  
Hash Algorithm ◽  
Plain Image ◽  
Secure Hash Algorithm ◽  
Low Sensitivity ◽  
Encryption Method

In this paper, an effective framework for chaotic encryption based on a three-dimensional logistic map is presented together with secure hash algorithm-3 (SHA-3) and electrocardiograph (ECG) signal. Following the analysis of the drawbacks, namely, fixed key and low sensitivity, of some current algorithms, this work tries to solve these two problems and includes two contributions: (1) removal of the phenomenon of summation invariance in a plain-image, for which SHA-3 is proposed to calculate the hash value for the plain-image, with the results being employed to influence the initial keys for chaotic map; (2) resolution of the problem of fixed key by using an ECG signal, that can be different for different subjects or different for same subject at different times. The Wolf algorithm is employed to produce all the control parameters and initial keys in the proposed encryption method. It is believed that combining with the classical architecture of permutation-diffusion, the summation invariance in the plain-image and shortcoming of a fixed key will be avoided in our algorithm. Furthermore, the experimental results and security analysis show that the proposed encryption algorithm can achieve confidentiality.

scholarly journals Free Will in Human Behavior and Physics

2020 ◽  
Author(s):  
Vasil Dinev Penchev
Keyword(s):  
Quantum Mechanics ◽  
Quantum Information ◽  
Free Will ◽  
Human Behavior ◽  
Physical World ◽  
Classical Physics ◽  
Quantum Bit ◽  
The Past ◽  
The Mean ◽  
The One

If the concept of “free will” is reduced to that of “choice” all physical world share the latter quality. Anyway the “free will” can be distinguished from the “choice”: The “free will” involves implicitly a certain goal, and the choice is only the mean, by which the aim can be achieved or not by the one who determines the target. Thus, for example, an electron has always a choice but not free will unlike a human possessing both. Consequently, and paradoxically, the determinism of classical physics is more subjective and more anthropomorphic than the indeterminism of quantum mechanics for the former presupposes certain deterministic goal implicitly following the model of human freewill behavior. Quantum mechanics introduces the choice in the fundament of physical world involving a generalized case of choice, which can be called “subjectless”: There is certain choice, which originates from the transition of the future into the past. Thus that kind of choice is shared of all existing and does not need any subject: It can be considered as a low of nature. There are a few theorems in quantum mechanics directly relevant to the topic: two of them are called “free will theorems” by their authors (Conway and Kochen 2006; 2009). Any quantum system either a human or an electron or whatever else has always a choice: Its behavior is not predetermined by its past. This is a physical law. It implies that a form of information, the quantum information underlies all existing for the unit of the quantity of information is an elementary choice: either a bit or a quantum bit (qubit).

Can quantum cryptography imply quantum mechanics? -- reply to Smolin

2005 ◽  
Vol 5 (2) ◽  
pp. 170-175
Author(s):  
H. Halvorson ◽  
J. Bub
Keyword(s):  
Quantum Mechanics ◽  
Quantum Cryptography ◽  
Physical Theory ◽  
Information Theoretic ◽  
Independence Condition

Clifton, Bub, and Halvorson (CBH) have argued that quantum mechanics can be derived from three cryptographic, or broadly information-theoretic, axioms. But Smolin disagrees, and he has given a toy theory that he claims is a counterexample. Here we show that Smolin's toy theory violates an independence condition for spacelike separated systems that was assumed in the CBH argument. We then argue that any acceptable physical theory should satisfy this independence condition.

Quantum Cryptography Key Distribution

2021 ◽  
pp. 325-344
Author(s):  
Bhanu Chander
Keyword(s):  
Quantum Mechanics ◽  
Information Transmission ◽  
Quantum Cryptography ◽  
Quantum Physics ◽  
Large Scale ◽  
Key Distribution ◽  
Computing Power ◽  
Contemporary State ◽  
Quantum Resistant Cryptography ◽  
Quantum Protocol

Quantum cryptography is actions to protect transactions through executing the circumstance of quantum physics. Up-to-the-minute cryptography builds security over the primitive ability of fragmenting enormous numbers into relevant primes; however, it features inconvenience with ever-increasing machine computing power along with current mathematical evolution. Among all the disputes, key distribution is the most important trouble in classical cryptography. Quantum cryptography endows with clandestine communication by means of offering a definitive protection statement with the rule of the atmosphere. Exploit quantum mechanics to cryptography can be enlarging unrestricted, unfailing information transmission. This chapter describes the contemporary state of classical cryptography along with the fundamentals of quantum cryptography, quantum protocol key distribution, implementation criteria, quantum protocol suite, quantum resistant cryptography, and large-scale quantum key challenges.

Sign in / Sign up

Export Citation Format

Share Document