157,254 research outputs found
Orthogonal-state-based protocols of quantum key agreement
Two orthogonal-state-based protocols of quantum key agreement (QKA) are
proposed. The first protocol of QKA proposed here is designed for two-party
QKA, whereas the second protocol is designed for multi-party QKA. Security of
these orthogonal-state-based protocols arise from monogamy of entanglement.
This is in contrast to the existing protocols of QKA where security arises from
the use of non-orthogonal state (non-commutativity principle). Further, it is
shown that all the quantum systems that are useful for implementation of
quantum dialogue and most of the protocols of secure direct quantum
communication can be modified to implement protocols of QKA.Comment: 9 pages, no figur
Reflections on security options for the real-time transport protocol framework
The Real-time Transport Protocol (RTP) supports a range of video conferencing, telephony, and streaming video ap- plications, but offers few native security features. We discuss the problem of securing RTP, considering the range of applications. We outline why this makes RTP a difficult protocol to secure, and describe the approach we have recently proposed in the IETF to provide security for RTP applications. This approach treats RTP as a framework with a set of extensible security building blocks, and prescribes mandatory-to-implement security at the level of different application classes, rather than at the level of the media transport protocol
Quantum e-commerce: A comparative study of possible protocols for online shopping and other tasks related to e-commerce
A set of quantum protocols for online shopping is proposed and analyzed to
establish that it is possible to perform secure online shopping using different
types of quantum resources. Specifically, a single photon based, a Bell state
based and two 3-qubit entangled state based quantum online shopping schemes are
proposed. The Bell state based scheme, being a completely orthogonal state
based protocol, is fundamentally different from the earlier proposed schemes
which were based on conjugate coding. One of the 3-qubit entangled state based
scheme is build on the principle of entanglement swapping which enables us to
accomplish the task without transmission of the message encoded qubits through
the channel. Possible ways of generalizing the entangled state based schemes
proposed here to the schemes which use multiqubit entangled states is also
discussed. Further, all the proposed protocols are shown to be free from the
limitations of the recently proposed protocol of Huang et al. (Quantum Inf.
Process. 14, 2211-2225, 2015) which allows the buyer (Alice) to change her
order at a later time (after initially placing the order and getting it
authenticated by the controller). The proposed schemes are also compared with
the existing schemes using qubit efficiency.Comment: It's shown that quantum e-commerce is not a difficult task, and it
can be done in various way
A symmetrization technique for continuous-variable quantum key distribution
We introduce a symmetrization technique which can be used as an extra step in
some continuous-variable quantum key distribution protocols. By randomizing the
data in phase space, one can dramatically simplify the security analysis of the
protocols, in particular in the case of collective attacks. The main
application of this procedure concerns protocols with postselection, for which
security was established only against Gaussian attacks until now. Here, we
prove that under some experimentally verifiable conditions, Gaussian attacks
are optimal among all collective attacks.Comment: 7 page
Quantum Conference
A notion of quantum conference is introduced in analogy with the usual notion
of a conference that happens frequently in today's world. Quantum conference is
defined as a multiparty secure communication task that allows each party to
communicate their messages simultaneously to all other parties in a secure
manner using quantum resources. Two efficient and secure protocols for quantum
conference have been proposed. The security and efficiency of the proposed
protocols have been analyzed critically. It is shown that the proposed
protocols can be realized using a large number of entangled states and group of
operators. Further, it is shown that the proposed schemes can be easily reduced
to protocol for multiparty quantum key distribution and some earlier proposed
schemes of quantum conference, where the notion of quantum conference was
different.Comment: 12 pages, 1 figur
A Survey on Wireless Sensor Network Security
Wireless sensor networks (WSNs) have recently attracted a lot of interest in
the research community due their wide range of applications. Due to distributed
nature of these networks and their deployment in remote areas, these networks
are vulnerable to numerous security threats that can adversely affect their
proper functioning. This problem is more critical if the network is deployed
for some mission-critical applications such as in a tactical battlefield.
Random failure of nodes is also very likely in real-life deployment scenarios.
Due to resource constraints in the sensor nodes, traditional security
mechanisms with large overhead of computation and communication are infeasible
in WSNs. Security in sensor networks is, therefore, a particularly challenging
task. This paper discusses the current state of the art in security mechanisms
for WSNs. Various types of attacks are discussed and their countermeasures
presented. A brief discussion on the future direction of research in WSN
security is also included.Comment: 24 pages, 4 figures, 2 table
Still Wrong Use of Pairings in Cryptography
Several pairing-based cryptographic protocols are recently proposed with a
wide variety of new novel applications including the ones in emerging
technologies like cloud computing, internet of things (IoT), e-health systems
and wearable technologies. There have been however a wide range of incorrect
use of these primitives. The paper of Galbraith, Paterson, and Smart (2006)
pointed out most of the issues related to the incorrect use of pairing-based
cryptography. However, we noticed that some recently proposed applications
still do not use these primitives correctly. This leads to unrealizable,
insecure or too inefficient designs of pairing-based protocols. We observed
that one reason is not being aware of the recent advancements on solving the
discrete logarithm problems in some groups. The main purpose of this article is
to give an understandable, informative, and the most up-to-date criteria for
the correct use of pairing-based cryptography. We thereby deliberately avoid
most of the technical details and rather give special emphasis on the
importance of the correct use of bilinear maps by realizing secure
cryptographic protocols. We list a collection of some recent papers having
wrong security assumptions or realizability/efficiency issues. Finally, we give
a compact and an up-to-date recipe of the correct use of pairings.Comment: 25 page
- …