A method of Authentication for Quantum Networks

Quantum cryptography offers a way of key agreement, which is unbreakable by any external adversary. Authentication is of crucial importance, as perfect secrecy is worthless if the identity of the addressee cannot be ensured before sending important information. Message authentication has been studied thoroughly, but no approach seems to be able to explicitly counter meet-in-the-middle impersonation attacks. The goal of this paper is the development of an authentication scheme being resistant against active adversaries controlling the communication channel. The scheme is built on top of a key-establishment protocol and is unconditionally secure if built upon quantum cryptographic key exchange. In general, the security is the same as for the key-agreement protocol lying underneath.

Authors:

• Stefan Rass

Keywords:

• Meet-in-the-middle attack
• quantum key distribution
• quantum networks
• unconditionally secure authentication.

References:

[1] C. Bennet. Quantum cryptography: Uncertainty in the service of privacy.
Science, 257(7):752-753, 1992.
[2] C. Bennet and G. Brassard. Quantum cryptography: Public key distribution
and coin tossing. In Proc. IEEE Int. Conference on Computers,
Systems, and Signal Processing, page 175, Bangalore, 1984.
[3] W. Diffie and M. Hellman. New directions in cryptography. IEEE
Transactions on Information Theory, IT-22(6):644-654, 1976.
[4] U. Feige, A. Fiat, and A. Shamir. Zero-knowledge proofs of identity. J.
Cryptology, 1(2):77-94, 1988.
[5] S. Ghernaouti-H'elie and M. Sfaxi. Upgrading PPP security by quantum
key distribution. In NetCon 2005 conference, 2005.
[6] S. Ghernaouti-H'elie, M. Sfaxi, G. Ribordy, and O. Gay. Using quantum
key distribution within IPSEC to secure MAN communications. In MAN
2005 conference, 2005.
[7] L. C. Guillou and J.-J. Quisquater. A practical zero-knowledge protocol
fitted to security microprocessors minimizing both transmission and
memory. In C. G. Gunther, editor, In Advances in Cryptology ÔÇö
EUROCRYPT -88, volume 330 of LNCS, pages 123-128. Springer-
Verlag, 1988.
[8] T. Helleseth and T. Johansson. Universal hash functions from exponential
sums over finite fields and galois rings. In CRYPTO -96: Proceedings
of the 16th Annual International Cryptology Conference on Advances
in Cryptology, pages 31-44, London, UK, 1996. Springer-Verlag.
[9] R. Koenig, U. Maurer, and R. Renner. On the power of quantum
memory. IEEE Transaction on Information Theory, 51(7):2391-2401,
July 2005.
[10] H. Krawczyk. LFSR-based hashing and authentication. In CRYPTO -94:
Proceedings of the 14th Annual International Cryptology Conference on
Advances in Cryptology, pages 129-139, London, UK, 1994. Springer-
Verlag.
[11] K. Mehlhorn and U. Vishkin. Randomized and deterministic simulations
of PRAMs by parallel machines with restricted granularity of parallel
memories. Acta Inf., 21(4):339-374, 1984.
[12] A. Menezes, P. C. van Oorschot, and S. Vanstone. Handbook of applied
Cryptography. CRC Press LLC, 1997.
[13] S. Rass. How to send messages over quantum networks in an unconditionally
secure manner. Technical Report TR-syssec-05-05, University of
Klagenfurt, Computer Science, System Security, Klagenfurt, September
2005.
[14] R. Renner and R. Koenig. Universally composable privacy amplification
against quantum adversaries. In J. Kilian, editor, 2nd Theory of
Cryptography Conference, TCC 2005, volume 3378 of LNCS, pages
407-425. Springer, Feb. 2005.
[15] P. Rogaway. Bucket hashing and its application to fast message
authentication. Journal of Cryptology, 12(2):91-115, 1999.
[16] P. Shor and J. Preskill. Simple proof of security of the BB84 quantum
key distribution protocol. Phys. Rev. Lett., 85:441-444, 2000.
[17] V. Shoup. On fast and provably secure message authentication based
on universal hashing. In CRYPTO -96: Proceedings of the 16th Annual
International Cryptology Conference on Advances in Cryptology, pages
313-328, London, UK, 1996. Springer-Verlag.
[18] D. R. Stinson. Universal hashing and authentication codes. In CRYPTO
-91: Proceedings of the 11th Annual International Cryptology Conference
on Advances in Cryptology, pages 74-85, London, UK, 1992.
Springer-Verlag.
[19] M. Wegman and J. Carter. Universal classes of hashing functions.
Journal of Computer and System Sciences, 22:265-279, 1981.
[20] M. Wegman and L. Carter. New hash functions and their use in
authentication and set equality. Journal of Computer and System
Sciences, 22:265-279, 1981.