22,055 research outputs found
Dense-Coding Attack on Three-Party Quantum Key Distribution Protocols
Cryptanalysis is an important branch in the study of cryptography, including
both the classical cryptography and the quantum one. In this paper we analyze
the security of two three-party quantum key distribution protocols (QKDPs)
proposed recently, and point out that they are susceptible to a simple and
effective attack, i.e. the dense-coding attack. It is shown that the
eavesdropper Eve can totally obtain the session key by sending entangled qubits
as the fake signal to Alice and performing collective measurements after
Alice's encoding. The attack process is just like a dense-coding communication
between Eve and Alice, where a special measurement basis is employed.
Furthermore, this attack does not introduce any errors to the transmitted
information and consequently will not be discovered by Alice and Bob. The
attack strategy is described in detail and a proof for its correctness is
given. At last, the root of this insecurity and a possible way to improve these
protocols are discussed.Comment: 6 pages, 3 figure
A high-speed multi-protocol quantum key distribution transmitter based on a dual-drive modulator
We propose a novel source based on a dual-drive modulator that is adaptable
and allows Alice to choose between various practical quantum key distribution
(QKD) protocols depending on what receiver she is communicating with.
Experimental results show that the proposed transmitter is suitable for
implementation of the Bennett and Brassard 1984 (BB84), coherent one-way (COW)
and differential phase shift (DPS) protocols with stable and low quantum bit
error rate. This could become a useful component in network QKD, where
multi-protocol capability is highly desirable.Comment: 15 pages, 7 figure
Coded Cooperative Data Exchange for a Secret Key
We consider a coded cooperative data exchange problem with the goal of
generating a secret key. Specifically, we investigate the number of public
transmissions required for a set of clients to agree on a secret key with
probability one, subject to the constraint that it remains private from an
eavesdropper.
Although the problems are closely related, we prove that secret key
generation with fewest number of linear transmissions is NP-hard, while it is
known that the analogous problem in traditional cooperative data exchange can
be solved in polynomial time. In doing this, we completely characterize the
best possible performance of linear coding schemes, and also prove that linear
codes can be strictly suboptimal. Finally, we extend the single-key results to
characterize the minimum number of public transmissions required to generate a
desired integer number of statistically independent secret keys.Comment: Full version of a paper that appeared at ISIT 2014. 19 pages, 2
figure
Lightweight Security for Network Coding
Under the emerging network coding paradigm, intermediate nodes in the network
are allowed not only to store and forward packets but also to process and mix
different data flows. We propose a low-complexity cryptographic scheme that
exploits the inherent security provided by random linear network coding and
offers the advantage of reduced overhead in comparison to traditional
end-to-end encryption of the entire data. Confidentiality is achieved by
protecting (or "locking") the source coefficients required to decode the
encoded data, without preventing intermediate nodes from running their standard
network coding operations. Our scheme can be easily combined with existing
techniques that counter active attacks.Comment: Proc. of the IEEE International Conference on Communications (ICC
2008), Beijing, China, May 200
Quantum Private Comparison: A Review
As an important branch of quantum secure multiparty computation, quantum
private comparison (QPC) has attracted more and more attention recently. In
this paper, according to the quantum implementation mechanism that these
protocols used, we divide these protocols into three categories: The quantum
cryptography QPC, the superdense coding QPC, and the entanglement swapping QPC.
And then, a more in-depth analysis on the research progress, design idea, and
substantive characteristics of corresponding QPC categories is carried out,
respectively. Finally, the applications of QPC and quantum secure multi-party
computation issues are discussed and, in addition, three possible research
mainstream directions are pointed out
Byzantine Modification Detection in Multicast Networks With Random Network Coding
An information-theoretic approach for detecting Byzantine or adversarial modifications in networks employing random linear network coding is described. Each exogenous source packet is augmented with a flexible number of hash symbols that are obtained as a polynomial function of the data symbols. This approach depends only on the adversary not knowing the random coding coefficients of all other packets received by the sink nodes when designing its adversarial packets. We show how the detection probability varies with the overhead (ratio of hash to data symbols), coding field size, and the amount of information unknown to the adversary about the random code
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
- …