Quantum authentication with unitary coding sets (original) (raw)
Related papers
Authenticated Transmission using Quantum Security
2012
Now a day’s Security of network transmission became a vital aspect, because the major security risks occur while conducting business on the Net; the following are some of the security risks occur: Unauthorized-Access, Eavesdropping, Password Sniffing, Denial of Service, Data modification, Repudiation. One of the methods to secure the information is Cryptography. It Protects data transmitted over the network lines, is mainly through appropriate Encryption techniques. The subject Cryptography deals with the encryption and decryption procedures. Encryption is the process of scrambling information so that it becomes unintelligible and can be unscrambled only by using keys. Encryption is the achieved using a Symmetric (or) Asymmetric Encryption. In Symmetric Encryption, a single key is used encrypt as well as to decrypt. In Asymmetric Encryption, two keys namely public and private key are used for encryption and decryption. The paper presentation is on the Authenticated Transmission usin...
On the Security and Composability of the
2008
Abstract. Motivated by a potentially flawed deployment of the one time pad in a recent quantumcryptographic application securing a bank transfer [12], we show how to implement a statistically secure system for message passing, that is, a channel with negligible failure rate secure againstunbounded adversaries, using a one time pad based cryptosystem. We prove the security of our system in the framework put forward by Backes, Pfitzmann, and Waidner [11, 2, 3]. 1 Introduction It is well known that the one time pad (OTP) is perfectly concealing, i.e. that given an arbitrary ciphertext c 2 {0, 1}n, the probability of any message m 2 M ` {0, 1}n is P (m|c) = P (m) where M denotes themessage space. Therefore one time pad based encryption is the obvious choice when dealing with unbounded
Carving Secret Messages out of Public Information
Journal of Computer Science, 2015
This study shows that secret information can be shared or passed from a sender to a receiver even if not encoded in a secret message. In the protocol designed in this study, no parts of the original secret information ever travel via communication channels between the source and the destination, no encoding/decoding key is ever used. The two communicating partners, Alice and Bob, are endowed with coherent qubits that can be read and set and keep their quantum values over time. Additionally, there exists a central authority that is capable of identifying Alice and Bob to share with each half of entangled qubit pairs. The central authority also performs entanglement swapping. Our protocol relies on the assumption that public information can be protected, an assumption present in all cryptographic protocols. Also any classical communication channel need not be authenticated. As each piece of secret information has a distinct public encoding, the protocol is equivalent to a one-time pad protocol.
Communicating Secret Information Without Secret Messages
2013
This paper shows that information can be shared or passed from a sender to a receiver even if not encoded in a message. In the protocol designed in this paper, no parts of useful information ever travel via communication channels between the source and the destination. The setting is a wireless sensor networks in which nodes are endowed with coherent qubits that can be read and set within the node. Additionally, there exists a central authority that manages the identity of the nodes and can perform entanglement swapping. Our protocol relies on the assumption that public information can be protected, an assumption present in all cryptographic protocols.
Quantum Shannon Theory in Secure Transmission Schemes
Quantum computers use the power of quantum physics to give rise to new types of security. For example, classical bits can be copied, but qubits generally cannot. With the recent introduction of quantum computers, there is an emerging need to harness the power of quantum cryptography schemes to overshadow the computing force of counterfeiters. In this article, we will investigate 2 major questions in cryptography, namely (1) how to communicate a secret securely among multiple parties and (2) how to create a secure quantum currency that is sustainable to quantum attacks. We will rst investigate the No-cloning theorem and the errorcorrection schemes, and plug these notations into threshold schemes and quantum money schemes to analyze how quantum mechanisms work in encrypting data, as well as how interactive attacks can possibly break the schemes. We do not provide a concrete answer to either of the questions, as all the methods discussed in this article have been proven to be vulnerable to attackers with adequate computing ability. Regardless, they are important foundations to more recent development in cryptography and public-key quantum money.
2010
This paper proposes a generic approach for providing enhanced security to communication systems which encode their data for reliability before encrypting it through a stream cipher for security. We call this counter-intuitive technique the encoding-encryption paradigm, and use as motivating example the standard for mobile telephony GSM. The enhanced security is based on a dedicated homophonic or wire-tap channel coding that introduces pure randomness, combined with the randomness of the noise occurring over the communication channel. Security evaluation regarding recovery of the secret key employed in the keystream generator is done through an information theoretical approach.
On quantum authentication protocols
GLOBECOM '05. IEEE Global Telecommunications Conference, 2005., 2005
When it became known that quantum computers could break the RSA (named for its creators-Rivest, Shamir, and Adleman) encryption algorithm within a polynomial-time, quantum cryptography began to be actively studied. Other classical cryptographic algorithms are only secure when malicious users do not have computational power enough to break security within a practical amount of time. Recently, many quantum authentication protocols sharing quantum entangled particles between communicators have been proposed, providing unconditional security. An issue caused by sharing quantum entangled particles is that it may not be simple to apply these protocols to authenticate a specific user in a group of many users. We propose an authentication protocol using quantum superposition states instead of quantum entangled particles. Our protocol can be implemented with the current technologies we introduce in this paper.
Coding theorems for secret-key authentication systems
This paper provides Shannon theoretic coding theorems on the impersonation attack and the substitution attack against authentication systems constructed by secret key cryptography. Though several lower bounds on the success probability of the impersonation attack and the substitution attack have been developed, their upper bounds are rarely discussed. This paper treats an extended authentication system including blocklength K and permits the decoding error probability tending to zero as K→∞. It is shown that 2-KI(W:E) is the smallest attainable upper bound of the success probability of the impersonation attack, where I(W;E) denotes the mutual information between cryptogram W and key E. A relationship between the success probability of the substitution attack and H(E|W) is also characterized, where H(E|W) denotes the conditional entropy of E given W
Public-Key Cryptography: Theory and Practice
2009
Carol makes a guess z about x. If z = 0, Carol takes C = A, else Carol takes C = HA. Carol measures C to get the classical bit k. Carol sends the measured qubit D to Bob. Bob processes D as if he has received A from Alice. Later, Alice and Bob disclose x and y. If x = y, the bits i, j, k are discarded. If x = y, Alice stores i, and Bob stores j. Carol may have caused i = j even when x = y.