Skip to Main content Skip to Navigation
Conference papers

An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security

Michel Abdalla 1, 2, 3 Fabrice Benhamouda 2, 3, 1 Alain Passelègue 3, 2, 1 
Abstract : In this work, we provide a new algebraic framework for pseudorandom functions which encompasses many of the existing algebraic constructions, including the ones by Naor and Reingold (FOCS’97), by Lewko and Waters (CCS’09), and by Boneh, Montgomery, and Raghunathan (CCS’10), as well as the related-key-secure pseudorandom functions by Bellare and Cash (Crypto’10) and by Abdalla et al. (Crypto’14). To achieve this goal, we introduce two versions of our framework. The first, termed linearly independent polynomial security, states that the values (g^{P_1(a)}, ..., g^{P_q(a)}) are indistinguishable from a random tuple of the same size, when P_1, ..., P_q are linearly independent multivariate polynomials of the secret key vector a. The second, which is a natural generalization of the first framework, additionally deals with constructions based on the decision linear and matrix Diffie-Hellman assumptions. In addition to unifying and simplifying proofs for existing schemes, our framework also yields new results, such as related-key security with respect to arbitrary permutations of polynomials. Our constructions are in the standard model and do not require the existence of multilinear maps.
Document type :
Conference papers
Complete list of metadata
Contributor : Michel Abdalla Connect in order to contact the contributor
Submitted on : Monday, July 13, 2015 - 12:27:22 AM
Last modification on : Thursday, March 17, 2022 - 10:08:37 AM

Links full text




Michel Abdalla, Fabrice Benhamouda, Alain Passelègue. An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security. CRYPTO 2015, Aug 2015, Santa Barbara, United States. pp.388-409, ⟨10.1007/978-3-662-47989-6_19⟩. ⟨hal-01175786⟩



Record views