Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks

  • Mihir Bellare
  • David Cash
Conference paper

DOI: 10.1007/978-3-642-14623-7_36

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6223)
Cite this paper as:
Bellare M., Cash D. (2010) Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg

Abstract

This paper fills an important foundational gap with the first proofs, under standard assumptions and in the standard model, of the existence of PRFs and PRPs resisting rich and relevant forms of relatedkey attack (RKA). An RKA allows the adversary to query the function not only under the target key but under other keys derived from it in adversary-specified ways. Based on the Naor-Reingold PRF we obtain an RKA-PRF whose keyspace is a group and that is proven, under DDH, to resist attacks in which the key may be operated on by arbitrary adversary-specified group elements. Our framework yields other RKA-PRFs including a DLIN-based one derived from the Lewko- Waters PRF.We show how to turn these PRFs into PRPs (blockciphers) while retaining security against RKAs. Over the last 17 years cryptanalysts and blockcipher designers have routinely and consistenly targeted RKA-security; it is important for abuse-resistant cryptography; and it helps protect against fault-injection sidechannel attacks. Yet ours are the first significant proofs of existence of secure constructs. We warn that our constructs are proofs-of-concept in the foundational style and not practical.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Mihir Bellare
    • 1
  • David Cash
    • 1
  1. 1.Dept. of Computer Science & EngineeringUniversity of California San DiegoUSA

Personalised recommendations