Related papers: The ping-pong protocol can be attacked without eav…
Here we present a new protocol for controlled quantum key agreement and another protocol for key agreement with a specific focus on the security analysis. Specifically, detailed security proof is provided against impersonated fraudulent…
The problem of securing a network coding communication system against an eavesdropper adversary is considered. The network implements linear network coding to deliver n packets from source to each receiver, and the adversary can eavesdrop…
In this work we present a comprehensive analysis of a post-selective attack on quantum key distribution protocols employing phase-encoded linearly independent coherent states (or similar alternatives). The attack relies on multimode…
A method is given to detect the presence of eavesdroppers when a noisy message is sent to a privileged receiver. A proof of the effectiveness if this method is demonstrated, and a comparison is made to other quantum cryptographic tasks.
Pinching-antenna systems have recently gained significant attention as a novel reconfigurable-antenna technology due to its exceptional capability of mitigating signal-propagation path loss. In this letter, we investigate the secrecy…
Using polarization-entangled photons from spontaneous parametric downconversion, we have implemented Ekert's quantum cryptography protocol. The near-perfect correlations of the photons allow the sharing of a secret key between two parties.…
In a recent comment, it has been shown that in a quantum secret sharing protocol proposed in [S. Bagherinezhad, V. Karimipour, Phys. Rev. {\bf A}, 67, 044302, (2003)], one of the receivers can cheat by splitting the entanglement of the…
We thoroughly analyse the novel quantum key distribution protocol introduced recently in quant-ph/0412075, which is based on minimal qubit tomography. We examine the efficiency of the protocol for a whole range of noise parameters and…
In this paper we present three attacks on private internal networks behind a NAT and a corresponding new protection mechanism, Internal Network Policy, to mitigate a wide range of attacks that penetrate internal networks behind a NAT. In…
In this short note we want to introduce {\em anonymous oblivious transfer} a new cryptographic primitive which can be proven to be strictly more powerful than oblivious transfer. We show that all functions can be robustly realized by multi…
We present a scheme for three-party simultaneous quantum secure direct communication by using EPR pairs. In the scheme, three legitimate parties can simultaneously exchange their secret messages. It is also proved to be secure against the…
We consider two-way continuous-variable quantum key distribution, studying its security against general eavesdropping strategies. Assuming the asymptotic limit of many signals exchanged, we prove that two-way Gaussian protocols are immune…
We propose an e-voting protocol that seems to allow citizens to verify that their vote has been accurately taken into account while preserving its secrecy, without requiring the use of a complex process. The main idea is to give each voter…
High voter turnout in elections and referendums is very desirable in order to ensure a robust democracy. Secure electronic voting is a vision for the future of elections and referendums. Such a system can counteract factors that hinder…
Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…
We present an one-time-pad key communication protocol that allows secure direct communication with entanglement. Alice can send message to Bob in a deterministic manner by using local measurements and public communication. The theoretical…
Secure communication over a wiretap channel is investigated, in which an active adversary modifies the state of the channel and the legitimate transmitter has the opportunity to sense and learn the adversary's actions. The adversary has the…
We investigate the possibility of "having someone carry out the work of executing a function for you, but without letting him learn anything about your input". Say Alice wants Bob to compute some known function f upon her input x, but wants…
We propose a way to retrieve the secure key generated by the coherent one way protocol without reading the information transmitted on the quantum channel.
Security against simple eavesdropping attacks is demonstrated for a recently proposed quantum key distribution protocol which uses the Fibonacci recursion relation to enable high-capacity key generation with entangled photon pairs. No…