Efficient shared-key authentication scheme from any weak pseudorandom function

Authors:
Ryo Nojima;Kazukuni Kobara;Hideki Imai
Affiliations:
Information Security Research Center, National Institute of Information and Communications Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan;Research Center for Information Security, National Institute of Advanced Industrial Science and Technology, Tokyo, Japan
Venue:
INDOCRYPT'06 Proceedings of the 7th international conference on Cryptology in India
Year:
2006

Citing 13
Cited 0

Cryptographic primitives based on hard learning problems

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Synthesizers and their application to the parallel construction of pseudo-random functions

Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Keying Hash Functions for Message Authentication

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
From Unpredictability to Indistinguishability: A Simple Construction of Pseudo-Random Functions from MACs (Extended Abstract)

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Secure Human Identification Protocols

ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
High-Speed Pseudorandom Number Generation with Small Memory

FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Number-theoretic constructions of efficient pseudo-random functions

Journal of the ACM (JACM)
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Authenticating pervasive devices with human protocols

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Parallel and concurrent security of the HB and HB+ protocols

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Luby-Rackoff ciphers from weak round functions?

EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the most widely used shared-key authentication schemes today is a challenge-response scheme. In this scheme, a function such as a message authentication code or a symmetric encryption scheme plays an important role. To ensure the security, we need to assume that these functions are included in a certain kind of functions family, e.g., a pseudorandom functions family. For example, functions such as SHA1-HMAC, DES and AES often assumed as the pseudorandom functions. But unfortunately, nobody knows that these functions are really pseudorandom functions and if not, then the security of the challenge-response scheme is not ensured any more. The common way to reduce this kind of fear is to construct the shared-key authentication scheme which can be proven secure with a weaker assumption on these functions. In this paper, we show that a blind-challenge-response shared-key authentication scheme which is a simple modified version of the original challenge-response authentication scheme can be constructed from a weaker cryptographic assumption known as weak pseudorandom functions.