A general scheme for information interception in the ping pong protocol

The existence of an undetectable eavesdropping of dense coded information has been already demonstrated by Pavi\v{c}i\'c for the quantum direct communication based on the ping-pong paradigm. However, a) the explicit scheme of the circuit is only given and no design rules are provided, b) the existence of losses is implicitly assumed, c) the attack has been formulated against qubit based protocol only and it is not clear whether it can be adapted to higher dimensional systems. These deficiencies are removed in the presented contribution. A new generic eavesdropping scheme built on a firm theoretical background is proposed. In contrast to the previous approach, it does not refer to the properties of the vacuum state, so it is fully consistent with the absence of losses assumption. Moreover, the scheme applies to the communication paradigm based on signal particles of any dimensionality. It is also shown that some well known attacks are special cases of the proposed scheme.Comment: 10 pages, 4 figure

Improving the capacity of the ping-pong protocol

We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable measurement basises in control mode to detect Eve's eavesdropping attack. In message mode, Alice can use one unitary operations to encode two bits information. Bob only needs to perform a Bell type measurement to decode Alice's information. A classical message authentification method can protect this protocol against the eavesdropping hiding in the quantum channel losses and the denial-of-service (DoS) attack.Comment: 3page; PACS:03.67.Hk, 03.65.U

Low-resource eclipse attacks on Ethereum’s peer-to-peer network

We present eclipse attacks on Ethereum nodes that exploit the peer-to-peer network used for neighbor discovery. Our attacks can be launched using only two hosts, each with a single IP address. Our eclipse attacker monopolizes all of the victim’s incoming and outgoing connections, thus isolating the victim from the rest of its peers in the network. The attacker can then filter the victim’s view of the blockchain, or co-opt the victim’s computing power as part of more sophisticated attacks. We argue that these eclipse-attack vulnerabilities result from Ethereum’s adoption of the Kademlia peer-to-peer protocol, and present countermeasures that both harden the network against eclipse attacks and cause it to behave differently from the traditional Kademlia protocol. Several of our countermeasures have been incorporated in the Ethereum geth 1.8 client released on February 14, 2018.First author draf

Exploiting Lack of Hardware Reciprocity for Sender-Node Authentication at the PHY Layer

This paper proposes to exploit the so-called reciprocity parameters (modelling non-reciprocal communication hardware) to use them as decision metric for binary hypothesis testing based authentication framework at a receiver node Bob. Specifically, Bob first learns the reciprocity parameters of the legitimate sender Alice via initial training. Then, during the test phase, Bob first obtains a measurement of reciprocity parameters of channel occupier (Alice, or, the intruder Eve). Then, with ground truth and current measurement both in hand, Bob carries out the hypothesis testing to automatically accept (reject) the packets sent by Alice (Eve). For the proposed scheme, we provide its success rate (the detection probability of Eve), and its performance comparison with other schemes

On the Minimization of Handover Decision Instability in Wireless Local Area Networks

This paper addresses handover decision instability which impacts negatively on both user perception and network performances. To this aim, a new technique called The HandOver Decision STAbility Technique (HODSTAT) is proposed for horizontal handover in Wireless Local Area Networks (WLAN) based on IEEE 802.11standard. HODSTAT is based on a hysteresis margin analysis that, combined with a utilitybased function, evaluates the need for the handover and determines if the handover is needed or avoided. Indeed, if a Mobile Terminal (MT) only transiently hands over to a better network, the gain from using this new network may be diminished by the handover overhead and short usage duration. The approach that we adopt throughout this article aims at reducing the minimum handover occurrence that leads to the interruption of network connectivity (this is due to the nature of handover in WLAN which is a break before make which causes additional delay and packet loss). To this end, MT rather performs a handover only if the connectivity of the current network is threatened or if the performance of a neighboring network is really better comparing the current one with a hysteresis margin. This hysteresis should make a tradeoff between handover occurrence and the necessity to change the current network of attachment. Our extensive simulation results show that our proposed algorithm outperforms other decision stability approaches for handover decision algorithm.Comment: 13 Pages, IJWM