scholarly journals Security of a semi-quantum protocol where reflections contribute to the secret key

2016 ◽  
Vol 15 (5) ◽  
pp. 2067-2090 ◽  
Author(s):  
Walter O. Krawec
Keyword(s):  
2010 ◽  
Vol 20 (03) ◽  
pp. 239-250 ◽  
Author(s):  
NAYA NAGY ◽  
MARIUS NAGY ◽  
SELIM G. AKL

It has been said that quantum cryptography in general offers a secure solution to the problem of key enhancement. This means that two parties who already share a small secret key, can use quantum protocols to establish a new large secret key. This large secret key can be arbitrarily long and is unbreakable. Thus, to date, the main contribution of quantum cryptography has been believed to be quantum key enhancement. This paper shows that quantum cryptography can do significantly more. The quantum protocol described here distributes an unbreakable secret key to the two parties by relying on public information only. This is the first time that quantum cryptography is shown to be able to produce secret information using only public information. This contribution is also unique for cryptography in general, classical and quantum.


2020 ◽  
Vol 34 (11) ◽  
pp. 2050106 ◽  
Author(s):  
Zhenbang Rong ◽  
Daowen Qiu ◽  
Xiangfu Zou

Semi-quantum protocol is a hot topic in quantum cryptography. One of the original motivational reasons to study semi-quantum protocol is to better understand “how quantum” a protocol needs to be in order to gain an advantage over its classical counterpart. Semi-quantum secure direct communication (SQSDC) is an important branch of the semi-quantum protocol, which makes it possible to directly transfer large amounts of data between quantum participant and classical participant without need to share the secret key in advance. In this paper, we propose two new SQSDC protocols based on single photons to study how to reduce the quantum resource requirements of both quantum participant and classical participant. In both protocols, the classical participant requires neither quantum memory or quantum delay lines. We first propose in the first protocol that the quantum participant only need to prepare single-state qubits in the preparation phase, which is different from previous SQSDC protocols. Then we propose in the second protocol that quantum participant can accomplish the same work as the first one even without quantum memory. Efficiency analysis shows that the first protocol is more efficient than some protocol, and the second one can save more quantum resources at the expense of some efficiency. Compared with the existing SQSDC protocols based on single photons, both protocols can use fewer quantum states or quantum resource requirements than other protocols. Finally, we analyze the security of both protocols.


Author(s):  
Lemcia Hutajulu ◽  
Hery Sunandar ◽  
Imam Saputra

Cryptography is used to protect the contents of information from anyone except those who have the authority or secret key to open information that has been encoded. Along with the development of technology and computers, the increase in computer crime has also increased, especially in image manipulation. There are many ways that people use to manipulate images that have a detrimental effect on others. The originality of a digital image is the authenticity of the image in terms of colors, shapes, objects and information without the slightest change from the other party. Nowadays many digital images circulating on the internet have been manipulated and even images have been used for material fraud in the competition, so we need a method that can detect the image is genuine or fake. In this study, the authors used the MD4 and SHA-384 methods to detect the originality of digital images, by using this method an image of doubtful authenticity can be found out that the image is authentic or fake.Keywords: Originality, Image, MD4 and SHA-384


2005 ◽  
Vol 1 (3-4) ◽  
pp. 345-354 ◽  
Author(s):  
Dibyendu Chakrabarti ◽  
Subhamoy Maitra ◽  
Bimal Roy

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal design.


2020 ◽  
Vol 62 (5-6) ◽  
pp. 287-293
Author(s):  
Felix Günther

AbstractSecure connections are at the heart of today’s Internet infrastructure, protecting the confidentiality, authenticity, and integrity of communication. Achieving these security goals is the responsibility of cryptographic schemes, more specifically two main building blocks of secure connections. First, a key exchange protocol is run to establish a shared secret key between two parties over a, potentially, insecure connection. Then, a secure channel protocol uses that shared key to securely transport the actual data to be exchanged. While security notions for classical designs of these components are well-established, recently developed and standardized major Internet security protocols like Google’s QUIC protocol and the Transport Layer Security (TLS) protocol version 1.3 introduce novel features for which supporting security theory is lacking.In my dissertation [20], which this article summarizes, I studied these novel and advanced design aspects, introducing enhanced security models and analyzing the security of deployed protocols. For key exchange protocols, my thesis introduces a new model for multi-stage key exchange to capture that recent designs for secure connections establish several cryptographic keys for various purposes and with differing levels of security. It further introduces a formalism for key confirmation, reflecting a long-established practical design criteria which however was lacking a comprehensive formal treatment so far. For secure channels, my thesis captures the cryptographic subtleties of streaming data transmission through a revised security model and approaches novel concepts to frequently update key material for enhanced security through a multi-key channel notion. These models are then applied to study (and confirm) the security of the QUIC and TLS 1.3 protocol designs.


Author(s):  
Francois Rottenberg ◽  
Trung-Hien Nguyen ◽  
Jean-Michel Dricot ◽  
Francois Horlin ◽  
Jerome Louveaux

Sign in / Sign up

Export Citation Format

Share Document