Related papers: On Ping-Pong protocol and its variant
It has been found that the signal can be encoded in the choice of the measurement basis of one of the communicating parties, while the outcomes of the measurement are irrelevant for the communication and therefore may be discarded. The…
A class of quantum protocols to teleport bipartite (entangled) states of two qubits is suggested. Our schemes require a single entangled pair shared by the two parties and the transmission of three bits of classical information, as well as…
In this work we study the problem of communication over the quantum wiretap channel. For this channel there are three parties Alice (sender), Bob (legitimate receiver) and Eve (eavesdropper). We obtain upper and lower bounds on the amount…
We propose a novel scheme for probabilistic teleportation when the information of the partially entangled state is only available for the sender. This is in contrast with the fact that the receiver must know the non-maximally entangled…
Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using…
Bidirectional quantum teleportation is a fundamental protocol for exchanging quantum information between two parties. Specifically, the two individuals make use of a shared resource state as well as local operations and classical…
We propose a new adversarial attack on frequency-hopping based wireless communication between two users, namely Alice and Bob. In this attack, the adversary, referred to as Eve, instantaneously modifies the transmitted signal by Alice…
Entanglement shared between two seperated parties could not be increased without transmitting quantum system. We suggest the project to gain entanglement shared between Alice and Bob by transmitting quantum system and a nem scheme to…
A set of new schemes for quantum computation and communication have been either designed or experimentally realized using optimal quantum resources. A multi-output quantum teleportation scheme, where a sender (Alice) teleports an m and…
Attack the ping-pong protocol without eavesdropping.
We consider MIMO (Multiple Input Multiple Output) wiretap channels, where a legitimate transmitter Alice is communicating with a legitimate receiver Bob in the presence of an eavesdropper Eve, and communication is done via MIMO channels. We…
This paper addresses the establishment of secure communication links between smart-meters (Alice) and an aggregator (Bob) in the presence of an eavesdropper (Eve). The proposed scenario assumes: (i) MIMOME wiretap channel; (ii) transmit…
We propose a scheme by which two parties can secretely and simultaneously exchange messages. The scheme requires the two parties to share entanglement and both to perform Bell-state measurements. Only two out of the four Bell states are…
It is well known that no quantum bit commitment protocol is unconditionally secure. Nonetheless, there can be non-trivial upper bounds on both Bob's probability of correctly estimating Alice's commitment and Alice's probability of…
We consider the multi-party classification problem introduced by Dong, Hartline, and Vijayaraghavan (2022) in the context of electronic discovery (e-discovery). Based on a request for production from the requesting party, the responding…
Cryptographic protocols are the backbone of our information society. This includes two-party protocols which offer protection against distrustful players. Such protocols can be built from a basic primitive called oblivious transfer. We…
The importance of being able to verify quantum computation delegated to remote servers increases with recent development of quantum technologies. In some of the proposed protocols for this task, a client delegates her quantum computation to…
Feasible interpolation is a general technique for proving proof complexity lower bounds. The monotone version of the technique converts, in its basic variant, lower bounds for monotone Boolean circuits separating two NP-sets to proof…
We present a multi-partite protocol in a counterfactual paradigm. In counterfactual quantum cryptography, secure information is transmitted between two spatially separated parties even when there is no physical travel of particles…
We prove that for every Bell's inequality and for a broad class of protocols, there always exists a multi-party communication complexity problem, for which the protocol assisted by states which violate the inequality is more efficient than…