7,260 research outputs found
A Principle for Cryptographic Protocols Beyond Security, Less Parameters
Almost cryptographic protocols are presented with security arguments. None of them, however, did explain why a protocol should like this, not like that. The reason is that there are
short of any principles for designing and analyzing cryptographic
protocols. In this paper, we put forth such a principle beyond
security, called Less Parameters, which says that the
involved parameters should be reduced as less as possible. Actually,
the principle ensures a protocol better cost. In different
scenarios, the principle is not easy to grasp. Intuitively, we
advise to introduce public parameters as less as possible. In the
light of the principle, we investigate some signatures. We
believe the techniques developed in this paper will be helpful to
better some cryptographic protocols
Variable Bias Coin Tossing
Alice is a charismatic quantum cryptographer who believes her parties are
unmissable; Bob is a (relatively) glamorous string theorist who believes he is
an indispensable guest. To prevent possibly traumatic collisions of
self-perception and reality, their social code requires that decisions about
invitation or acceptance be made via a cryptographically secure variable bias
coin toss (VBCT). This generates a shared random bit by the toss of a coin
whose bias is secretly chosen, within a stipulated range, by one of the
parties; the other party learns only the random bit. Thus one party can
secretly influence the outcome, while both can save face by blaming any
negative decisions on bad luck.
We describe here some cryptographic VBCT protocols whose security is
guaranteed by quantum theory and the impossibility of superluminal signalling,
setting our results in the context of a general discussion of secure two-party
computation. We also briefly discuss other cryptographic applications of VBCT.Comment: 14 pages, minor correction
Using quantum key distribution for cryptographic purposes: a survey
The appealing feature of quantum key distribution (QKD), from a cryptographic
viewpoint, is the ability to prove the information-theoretic security (ITS) of
the established keys. As a key establishment primitive, QKD however does not
provide a standalone security service in its own: the secret keys established
by QKD are in general then used by a subsequent cryptographic applications for
which the requirements, the context of use and the security properties can
vary. It is therefore important, in the perspective of integrating QKD in
security infrastructures, to analyze how QKD can be combined with other
cryptographic primitives. The purpose of this survey article, which is mostly
centered on European research results, is to contribute to such an analysis. We
first review and compare the properties of the existing key establishment
techniques, QKD being one of them. We then study more specifically two generic
scenarios related to the practical use of QKD in cryptographic infrastructures:
1) using QKD as a key renewal technique for a symmetric cipher over a
point-to-point link; 2) using QKD in a network containing many users with the
objective of offering any-to-any key establishment service. We discuss the
constraints as well as the potential interest of using QKD in these contexts.
We finally give an overview of challenges relative to the development of QKD
technology that also constitute potential avenues for cryptographic research.Comment: Revised version of the SECOQC White Paper. Published in the special
issue on QKD of TCS, Theoretical Computer Science (2014), pp. 62-8
Secure Vehicular Communication Systems: Implementation, Performance, and Research Challenges
Vehicular Communication (VC) systems are on the verge of practical
deployment. Nonetheless, their security and privacy protection is one of the
problems that have been addressed only recently. In order to show the
feasibility of secure VC, certain implementations are required. In [1] we
discuss the design of a VC security system that has emerged as a result of the
European SeVeCom project. In this second paper, we discuss various issues
related to the implementation and deployment aspects of secure VC systems.
Moreover, we provide an outlook on open security research issues that will
arise as VC systems develop from today's simple prototypes to full-fledged
systems
Certified randomness in quantum physics
The concept of randomness plays an important role in many disciplines. On one
hand, the question of whether random processes exist is fundamental for our
understanding of nature. On the other hand, randomness is a resource for
cryptography, algorithms and simulations. Standard methods for generating
randomness rely on assumptions on the devices that are difficult to meet in
practice. However, quantum technologies allow for new methods for generating
certified randomness. These methods are known as device-independent because do
not rely on any modeling of the devices. Here we review the efforts and
challenges to design device-independent randomness generators.Comment: 18 pages, 3 figure
Virtual Entanglement and Reconciliation Protocols for Quantum Cryptography with Continuous Variables
We discuss quantum key distribution protocols using quantum continuous
variables. We show that such protocols can be made secure against individual
gaussian attacks regardless the transmission of the optical line between Alice
and Bob. This is achieved by reversing the reconciliation procedure subsequent
to the quantum transmission, that is, using Bob's instead of Alice's data to
build the key. Although squeezing or entanglement may be helpful to improve the
resistance to noise, they are not required for the protocols to remain secure
with high losses. Therefore, these protocols can be implemented very simply by
transmitting coherent states and performing homodyne detection. Here, we show
that entanglement nevertheless plays a crucial role in the security analysis of
coherent state protocols. Every cryptographic protocol based on displaced
gaussian states turns out to be equivalent to an entanglement-based protocol,
even though no entanglement is actually present. This equivalence even holds in
the absence of squeezing, for coherent state protocols. This ``virtual''
entanglement is important to assess the security of these protocols as it
provides an upper bound on the mutual information between Alice and Bob if they
had used entanglement. The resulting security criteria are compared to the
separability criterion for bipartite gaussian variables. It appears that the
security thresholds are well within the entanglement region. This supports the
idea that coherent state quantum cryptography may be unconditionally secure.Comment: 18 pages, 6 figures. Submitted to QI
The Quantum Frontier
The success of the abstract model of computation, in terms of bits, logical
operations, programming language constructs, and the like, makes it easy to
forget that computation is a physical process. Our cherished notions of
computation and information are grounded in classical mechanics, but the
physics underlying our world is quantum. In the early 80s researchers began to
ask how computation would change if we adopted a quantum mechanical, instead of
a classical mechanical, view of computation. Slowly, a new picture of
computation arose, one that gave rise to a variety of faster algorithms, novel
cryptographic mechanisms, and alternative methods of communication. Small
quantum information processing devices have been built, and efforts are
underway to build larger ones. Even apart from the existence of these devices,
the quantum view on information processing has provided significant insight
into the nature of computation and information, and a deeper understanding of
the physics of our universe and its connections with computation.
We start by describing aspects of quantum mechanics that are at the heart of
a quantum view of information processing. We give our own idiosyncratic view of
a number of these topics in the hopes of correcting common misconceptions and
highlighting aspects that are often overlooked. A number of the phenomena
described were initially viewed as oddities of quantum mechanics. It was
quantum information processing, first quantum cryptography and then, more
dramatically, quantum computing, that turned the tables and showed that these
oddities could be put to practical effect. It is these application we describe
next. We conclude with a section describing some of the many questions left for
future work, especially the mysteries surrounding where the power of quantum
information ultimately comes from.Comment: Invited book chapter for Computation for Humanity - Information
Technology to Advance Society to be published by CRC Press. Concepts
clarified and style made more uniform in version 2. Many thanks to the
referees for their suggestions for improvement
- …