Protocols for Message Authentication from a Weak Secret

Abstract:

An authentication protocol is a procedure by which a sender tries to convey n bits of information, which we call an input message, to a receiver. An adversary controls the network over which the sender and the receiver talk and may change any message before it reaches its destination. This paper deals with the simple scenario where two parties, Alice and Bob, communicate and want to assure that the message received by Bob is the one sent by Alice. Unconditional cryptographic security cannot be generated simply from scratch, but must be based on some given primitive to start with. In this paper, we introduce a message authentication protocol with unconditional cryptographic security. More precisely, we give protocols using a weakly secret key allowing for the exchange of authenticated messages.

• Periodical: Applied Mechanics and Materials (Volumes 380-384)
• Pages: 2892-2896
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.380-384.2892
• Online since: August 2013
• Authors: Li Guo, Gang Yao
• Keywords: Authentication, Unconditional Security, Weak Secret

References

[1] E. Gilbert, F. J. MacWiUiams, and N. Sloane, Codes which detect deception, The Bell System Technical Journal, 53(3), March (1974).

DOI: 10.1002/j.1538-7305.1974.tb02751.x

[2] M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, J. Computer and System Sci., vol. 22, pp.265-279, (1981).

DOI: 10.1016/0022-0000(81)90033-7

[3] D. W. Davies and D. O. Clayden, A message authenticator algorithm suitable for a main frame computer, NPL Report DITC 17/83, (1983).

[4] P. Gemmell and M. Naor, Codes for interactive authentication", Advances in Cryptology — CRYPTO, 93, LNCS, Vol. 773, pp.355-367, Springer-Verlag, (1993).

DOI: 10.1007/3-540-48329-2_30

[5] Y. Dodis and J. Spencer, On the (non)universality of the one-time pad, Proceedings of FOCS 2002, pp.376-388, IEEE press, (2002).

[6] S. Wolf, Strong security against active attacks in information-theoretic secret-key agreement", Advances in Cryptology — ASIACRYPT, 98, LNCS 1514, pp.405-419, Springer-Verlag, (1998).

DOI: 10.1007/3-540-49649-1_32

[7] U. M. Maurer and S. Wolf, Secret-key agreement over unauthenticated public channels — Part III: Privacy amplification, IEEE Trans. on Information Theory, 49(4), pp.839-851, (2003).

DOI: 10.1109/tit.2003.809559

[8] R. Renner and S. Wolf, Unconditional authenticity and privacy from an arbitrarily weak secret, Advances in Cryptology — CRYPTO 2003, LNCS 2729, pp.78-95, Springer-Verlag, (2003).

DOI: 10.1007/978-3-540-45146-4_5

[9] Y. Dodis, J. Katz, L. Reyzin, A. Smith, Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets, Advances in Cryptology — CRYPTO 2006, LNCS 4117, pp.232-250, Springer-Verlag, (2006).

DOI: 10.1007/11818175_14

[10] Y. Dodis, D. Wichs, Non-Malleable Extractors and Symmetric Key Cryptography from Weak Secrets, STOC 2009, pp.601-610, ACM Press, (2009).

DOI: 10.1145/1536414.1536496

[11] X. Boyen, C. Chevalier, G. Fuchsbauer, D. Pointcheval, Strong Cryptography from Weak Secrets, AFRICACRYPT 2010, LNCS 6055, pp.297-315, Springer-Verlag, (2010).

DOI: 10.1007/978-3-642-12678-9_18