427 research outputs found
Trusted-HB: a low-cost version of HB+ secure against Man-in-The-Middle attacks
Since the introduction at Crypto'05 by Juels and Weis of the protocol HB+, a
lightweight protocol secure against active attacks but only in a detection
based-model, many works have tried to enhance its security. We propose here a
new approach to achieve resistance against Man-in-The-Middle attacks. Our
requirements - in terms of extra communications and hardware - are surprisingly
low.Comment: submitted to IEEE Transactions on Information Theor
Authenticated tree parity machine key exchange
The synchronisation of Tree Parity Machines (TPMs), has proven to provide a
valuable alternative concept for secure symmetric key exchange. Yet, from a
cryptographer's point of view, authentication is at least as important as a
secure exchange of keys. Adding an authentication via hashing e.g. is
straightforward but with no relation to Neural Cryptography. We consequently
formulate an authenticated key exchange within this concept. Another
alternative, integrating a Zero-Knowledge protocol into the synchronisation, is
also presented. A Man-In-The-Middle attack and even all currently known
attacks, that are based on using identically structured TPMs and
synchronisation as well, can so be averted. This in turn has practical
consequences on using the trajectory in weight space. Both suggestions have the
advantage of not affecting the previously observed physics of this interacting
system at all.Comment: This work directly relates to cond-mat/0202112 (see also
http://arxiv.org/find/cond-mat/1/au:+Kinzel/0/1/0/all/0/1
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys
Quantum digital signatures (QDS), generating correlated bit strings among
three remote parties for signatures through quantum law, can guarantee
non-repudiation, authenticity, and integrity of messages. Recently, one-time
universal hashing QDS framework, exploiting the quantum asymmetric encryption
and universal hash functions, has been proposed to significantly improve the
signature rate and ensure unconditional security by directly signing the hash
value of long messages. However, similar to quantum key distribution, this
framework utilizes keys with perfect secrecy by performing privacy
amplification that introduces cumbersome matrix operations, thereby consuming
large computational resources, causing delays and increasing failure
probability. Here, we prove that, different from private communication,
imperfect quantum keys with limited information leakage can be used for digital
signatures and authentication without compromising the security while having
eight orders of magnitude improvement on signature rate for signing a megabit
message compared with conventional single-bit schemes. This study significantly
reduces the delay for data postprocessing and is compatible with any quantum
key generation protocols. In our simulation, taking two-photon twin-field key
generation protocol as an example, QDS can be practically implemented over a
fiber distance of 650 km between the signer and receiver. For the first time,
this study offers a cryptographic application of quantum keys with imperfect
secrecy and paves a way for the practical and agile implementation of digital
signatures in a future quantum network.Comment: Comments are welcome
Evaluation of Some Algorithms for Hardware-Oriented Message Authentication
In this technical report, we consider ultra light-weight constructions of message authentication in hardware applications. We examine several known constructions and evaluate details around their hardware implementations. These constructions are all based on the framework of universal hash functions
Slender PUF Protocol: A lightweight, robust, and secure authentication by substring matching
We introduce Slender PUF protocol, an efficient
and secure method to authenticate the responses
generated from a Strong Physical Unclonable Function
(PUF). The new method is lightweight, and suitable for
energy constrained platforms such as ultra-low power embedded
systems for use in identification and authentication
applications. The proposed protocol does not follow the
classic paradigm of exposing the full PUF responses (or
a transformation of the full string of responses) on the
communication channel. Instead, random subsets of the
responses are revealed and sent for authentication. The
response patterns are used for authenticating the prover
device with a very high probability.We perform a thorough
analysis of the method’s resiliency to various attacks
which guides adjustment of our protocol parameters for
an efficient and secure implementation. We demonstrate
that Slender PUF protocol, if carefully designed, will be
resilient against all known machine learning attacks. In
addition, it has the great advantage of an inbuilt PUF error
tolerance. Thus, Slender PUF protocol is lightweight and
does not require costly additional error correction, fuzzy
extractors, and hash modules suggested in most previously
known PUF-based robust authentication techniques. The
low overhead and practicality of the protocol are confirmed
by a set of hardware implementation and evaluations
Experimental quantum secure network with digital signatures and encryption
Cryptography promises four information security objectives, namely,
confidentiality, integrity, authenticity, and non-repudiation, to support
trillions of transactions annually in the digital economy. Efficient digital
signatures, ensuring the integrity, authenticity, and non-repudiation of data
with information-theoretical security are highly urgent and intractable open
problems in cryptography. Here, we propose a protocol of high-efficiency
quantum digital signatures using secret sharing, one-time universal
hashing, and the one-time pad. We just need to use a 384-bit key to sign
documents of up to lengths with a security bound of . If
one-megabit document is signed, the signature efficiency is improved by more
than times compared with previous quantum digital signature protocols.
Furthermore, we build the first all-in-one quantum secure network integrating
information-theoretically secure communication, digital signatures, secret
sharing, and conference key agreement and experimentally demonstrate this
signature efficiency advantage. Our work completes the cryptography toolbox of
the four information security objectives.Comment: 19 pages, 7 figures, 4 tables. Quantum digital signatures and quantum
private communication maintain a consistent level of practicalit
- …