Probabilistic secret sharing through noise quantum channe

2012 ◽  
Vol 12 (3&4) ◽  
pp. 253-261
Author(s):  
Satyabrata Adhikari ◽  
Indranil Chakrabarty ◽  
Pankaj Agrawal

In a realistic situation, the secret sharing of classical or quantum information will involve the transmission of this information through noisy channels. We consider a three qubit pure state. This state becomes a mixed-state when the qubits are distributed over noisy channels. We focus on a specific noisy channel, the phase-damping channel. We propose a protocol for secret sharing of classical information with this and related noisy channels. This protocol can also be thought of as cooperative superdense coding. We also discuss other noisy channels to examine the possibility of secret sharing of classical information.

Author(s):  
Volkan Erol

Quantum Correlations are studied extensively in quantum information domain. Entanglement Measures and Quantum Discord are good examples of these actively studied correlations. Detection of violation in Bell inequalities is also a widely active area in quantum information theory world. In this work, we revisit the problem of analyzing the behavior of quantum correlations and violation of Bell inequalities in noisy channels. We extend the problem defined in [1] by observing the changes in negativity measure, quantum discord and a modified version of Horodecki measure for violation of Bell inequalities under amplitude damping, phase damping and depolarizing channels. We report different interesting results for each of these correlations and measures. All these correlations and measures decrease under decoherence channels, but some changes are very dramatical comparing to others. We investigate also separability conditions of example studied states.


Author(s):  
Volkan Erol

Quantum Correlations are studied extensively in quantum information domain. Entanglement Measures and Quantum Discord are good examples of these actively studied correlations. Detection of violation in Bell inequalities is also a widely active area in quantum information theory world. In this work, we revisit the problem of analyzing the behavior of quantum correlations and violation of Bell inequalities in noisy channels. We extend the problem defined in a recent study by observing the changes in negativity measure, quantum discord and a modified version of Horodecki measure for violation of Bell inequalities under amplitude damping, phase damping and depolarizing channels. We report different interesting results for each of these correlations and measures. All these correlations and measures decrease under decoherence channels, but some changes are very dramatical comparing to others. We investigate also separability conditions of example studied states.


2020 ◽  
Vol 2020 (4) ◽  
pp. 76-1-76-7
Author(s):  
Swaroop Shankar Prasad ◽  
Ofer Hadar ◽  
Ilia Polian

Image steganography can have legitimate uses, for example, augmenting an image with a watermark for copyright reasons, but can also be utilized for malicious purposes. We investigate the detection of malicious steganography using neural networkbased classification when images are transmitted through a noisy channel. Noise makes detection harder because the classifier must not only detect perturbations in the image but also decide whether they are due to the malicious steganographic modifications or due to natural noise. Our results show that reliable detection is possible even for state-of-the-art steganographic algorithms that insert stego bits not affecting an image’s visual quality. The detection accuracy is high (above 85%) if the payload, or the amount of the steganographic content in an image, exceeds a certain threshold. At the same time, noise critically affects the steganographic information being transmitted, both through desynchronization (destruction of information which bits of the image contain steganographic information) and by flipping these bits themselves. This will force the adversary to use a redundant encoding with a substantial number of error-correction bits for reliable transmission, making detection feasible even for small payloads.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Yao-Hsin Chou ◽  
Guo-Jyun Zeng ◽  
Xing-Yu Chen ◽  
Shu-Yu Kuo

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.


2014 ◽  
Vol 25 (05) ◽  
pp. 563-584 ◽  
Author(s):  
PARTHA SARATHI MANDAL ◽  
ANIL K. GHOSH

Location verification in wireless sensor networks (WSNs) is quite challenging in the presence of malicious sensor nodes, which are called attackers. These attackers try to break the verification protocol by reporting their incorrect locations during the verification stage. In the literature of WSNs, most of the existing methods of location verification use a set of trusted verifiers, which are vulnerable to attacks by malicious nodes. These existing methods also use some distance estimation techniques, which are not accurate in noisy channels. In this article, we adopt a statistical approach for secure location verification to overcome these limitations. Our proposed method does not rely on any trusted entities and it takes care of the limited precision in distance estimation by using a suitable probability model for the noise. The resulting verification scheme detects and filters out all malicious nodes from the network with a very high probability even when it is in a noisy channel.


2009 ◽  
Vol 18 (11) ◽  
pp. 4690-4694 ◽  
Author(s):  
Gu Bin ◽  
Li Chuan-Qi ◽  
Xu Fei ◽  
Chen Yu-Lin

2003 ◽  
Vol 14 (05) ◽  
pp. 741-755 ◽  
Author(s):  
JAN BOUDA ◽  
VLADIMÍ R. BUŽEK

We study in detail the problem of encryption of quantum information. We present an attack on a private quantum channel (PQC) which applies when partial classical description of a ciphertext is known (the so-called known-ciphertext attack) and we show how this situation can be avoided. The quantum analogue of the known plaintext attack is also discussed. We determine how correlations between quantum systems can be encrypted and we conclude that two PQCs on the subsystems form a PQC on the whole composite system. Finally, some applications of the PQC are suggested and a security of a noisy channel is discussed.


Author(s):  
STEPHEN D. BARTLETT ◽  
HOWARD. M. WISEMAN ◽  
ROBERT W. SPEKKENS ◽  
ANDREW C. DOHERTY
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document