#### Filter Results:

- Full text PDF available (7)

#### Publication Year

2014

2017

- This year (2)
- Last 5 years (9)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Michel Abdalla, Fabrice Benhamouda, Alain Passelègue
- CRYPTO
- 2015

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… (More)

- Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud
- EUROCRYPT
- 2016

Many cryptographic algorithms are vulnerable to side channel analysis and several leakage models have been introduced to better understand these flaws. In 2003, Ishai, Sahai and Wagner introduced the d-probing security model, in which an attacker can observe at most d intermediate values during a processing. They also proposed an algorithm that securely… (More)

Related-key attacks (RKAs) concern the security of cryptographic primitives in the situation where the key can be manipulated by the adversary. In the RKA setting, the adversary’s power is expressed through the class of related-key deriving (RKD) functions which the adversary is restricted to using when modifying keys. Bellare and Kohno (Eurocrypt 2003)… (More)

- Nir Bitansky, Ryo Nishimaki, Alain Passelègue, Daniel Wichs
- IACR Cryptology ePrint Archive
- 2016

Functional encryption lies at the frontiers of current research in cryptography; some variants have been shown sufficiently powerful to yield indistinguishability obfuscation (IO) while other variants have been constructed from standard assumptions such as LWE. Indeed, most variants have been classified as belonging to either the former or the latter… (More)

- Marc Joye, Alain Passelègue
- IACR Cryptology ePrint Archive
- 2016

Multi-input functional encryption is a paradigm that allows an authorized user to compute a certain function —and nothing more— over multiple plaintexts given only their encryption. The particular case of two-input functional encryption has very exciting applications like comparing the relative order of two plaintexts from their encrypted form, making range… (More)

- Michel Abdalla, Fabrice Benhamouda, Alain Passelègue
- IACR Cryptology ePrint Archive
- 2015

Since its introduction, pseudorandom functions (PRFs) have become one of the main building blocks of cryptographic protocols. In this work, we revisit two recent extensions of standard PRFs, namely multilinear and aggregate PRFs, and provide several new results for these primitives. In the case of aggregate PRFs, one of our main results is a proof of… (More)

- Michel Abdalla, Fabrice Benhamouda, Alain Passelègue
- IACR Cryptology ePrint Archive
- 2017

Due to the vast number of successful related-key attacks against existing block-ciphers, related-key security has become a common design goal for such primitives. In these attacks, the adversary is not only capable of seeing the output of a function on inputs of its choice, but also on related keys. At Crypto 2010, Bellare and Cash proposed the first… (More)

- Alain Passelègue
- 2016

- ‹
- 1
- ›