From Rational Number Reconstruction to Set Reconciliation and File Synchronization. - Antoine Amarilli; Fabrice Ben Hamouda; Florian Bourse; Robin Morisset; David Naccache; Pablo Rauzy (TGC, 2012)

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages. - Fabrice Ben Hamouda; Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (Public Key Cryptography, 2013)

SPHF-Friendly Non-Interactive Commitments. - Michel Abdalla; Fabrice Benhamouda; Olivier Blazy; Céline Chevalier; David Pointcheval (IACR Cryptol. ePrint Arch., 2013)

Verifier-Based Password-Authenticated Key Exchange: New Models and Constructions. - Fabrice Benhamouda; David Pointcheval (IACR Cryptol. ePrint Arch., 2013)

New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange. - Fabrice Ben Hamouda; Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2013)

Trapdoor Smooth Projective Hash Functions. - Fabrice Ben Hamouda; David Pointcheval (IACR Cryptol. ePrint Arch., 2013)

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures. - Fabrice Benhamouda; Jan Camenisch; Stephan Krenn; Vadim Lyubashevsky; Gregory Neven (ASIACRYPT (1), 2014)

Removing Erasures with Explainable Hash Proof Systems. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (IACR Cryptol. ePrint Arch., 2014)

Disjunctions for Hash Proof Systems: New Constructions and Applications. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (IACR Cryptol. ePrint Arch., 2014)

SPOKE: Simple Password-Only Key Exchange in the Standard Model. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (IACR Cryptol. ePrint Arch., 2014)

Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings. - Fabrice Benhamouda; Stephan Krenn; Vadim Lyubashevsky; Krzysztof Pietrzak (IACR Cryptol. ePrint Arch., 2014)

Security of the J-PAKE Password-Authenticated Key Exchange Protocol. - Michel Abdalla; Fabrice Benhamouda; Philip MacKenzie (IEEE Symposium on Security and Privacy, 2015)

Tighter Reductions for Forward-Secure Signature Schemes. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (IACR Cryptol. ePrint Arch., 2015)

An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security. - Michel Abdalla; Fabrice Benhamouda; Alain Passelègue (IACR Cryptol. ePrint Arch., 2015)

Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security. - Michel Abdalla; Fabrice Benhamouda; Alain Passelègue (IACR Cryptol. ePrint Arch., 2015)

New Techniques for SPHFs and Efficient One-Round PAKE Protocols. - Fabrice Benhamouda; Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2015)

Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting. - Fabrice Benhamouda; Geoffroy Couteau; David Pointcheval; Hoeteck Wee (IACR Cryptol. ePrint Arch., 2015)

Randomness Complexity of Private Circuits for Multiplication. - Sonia Belaïd; Fabrice Benhamouda; Alain Passelègue; Emmanuel Prouff; Adrian Thillard; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2016)

Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness. - Fabrice Benhamouda; Céline Chevalier; Adrian Thillard; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2016)

Optimization of Bootstrapping in Circuits. - Fabrice Benhamouda; Tancrède Lepoint; Claire Mathieu; Hang Zhou 001 (IACR Cryptol. ePrint Arch., 2016)

Public-key encryption indistinguishable under plaintext-checkable attacks. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (IET Inf. Secur., 2016)

A New Framework for Privacy-Preserving Aggregation of Time-Series Data. - Fabrice Benhamouda; Marc Joye; Benoît Libert (ACM Trans. Inf. Syst. Secur., 2016)

Diverse modules and zero-knowledge. - Fabrice Ben Hamouda-Guichoux (2016)

Private Multiplication over Finite Fields. - Sonia Belaïd; Fabrice Benhamouda; Alain Passelègue; Emmanuel Prouff; Adrian Thillard; Damien Vergnaud (CRYPTO (3), 2017)

Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps. - Michel Abdalla; Fabrice Benhamouda; Alain Passelègue (IACR Cryptol. ePrint Arch., 2017)

Hash Proof Systems over Lattices Revisited. - Fabrice Benhamouda; Olivier Blazy; Léo Ducas; Willy Quach (IACR Cryptol. ePrint Arch., 2017)

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions. - Fabrice Benhamouda; Florian Bourse; Helger Lipmaa (IACR Cryptol. ePrint Arch., 2017)

Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms. - Fabrice Benhamouda; Houda Ferradi; Rémi Géraud; David Naccache (IACR Cryptol. ePrint Arch., 2017)

Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion. - Fabrice Benhamouda; Hugo Krawczyk; Tal Rabin (IACR Cryptol. ePrint Arch., 2017)

k-Round MPC from k-Round OT via Garbled Interactive Circuits. - Fabrice Benhamouda; Huijia Lin (IACR Cryptol. ePrint Arch., 2017)

Efficient Cryptosystems From 2k-th Power Residue Symbols. - Fabrice Benhamouda; Javier Herranz; Marc Joye; Benoît Libert (J. Cryptol., 2017)

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits. - Fabrice Benhamouda; Huijia Lin (EUROCRYPT (2), 2018)

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions. - Fabrice Benhamouda; Huijia Lin; Antigoni Polychroniadou; Muthuramakrishnan Venkitasubramaniam (TCC (1), 2018)

How to Profile Privacy-Conscious Users in Recommender Systems. - Fabrice Benhamouda; Marc Joye (CoRR, 2018)

Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier. - Michel Abdalla; Fabrice Benhamouda; Alain Passelègue; Kenneth G. Paterson (J. Cryptol., 2018)

Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation. - Tzipora Halevi; Fabrice Benhamouda; Angelo De Caro; Shai Halevi; Charanjit S. Jutla; Yacov Manevich; Qi Zhang 009 (Blockchain, 2019)

From Single-Input to Multi-Client Inner-Product Functional Encryption. - Michel Abdalla; Fabrice Benhamouda; Romain Gay (IACR Cryptol. ePrint Arch., 2019)

Decentralizing Inner-Product Functional Encryption. - Michel Abdalla; Fabrice Benhamouda; Markulf Kohlweiss; Hendrik Waldner (IACR Cryptol. ePrint Arch., 2019)

Supporting private data on Hyperledger Fabric with secure multiparty computation. - Fabrice Benhamouda; Shai Halevi; Tzipora Halevi (IBM J. Res. Dev., 2019)

On the Tightness of Forward-Secure Signature Reductions. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (J. Cryptol., 2019)

Can a Public Blockchain Keep a Secret? - Fabrice Benhamouda; Craig Gentry; Sergey Gorbunov 001; Shai Halevi; Hugo Krawczyk; Chengyu Lin 001; Tal Rabin; Leonid Reyzin (TCC (1), 2020)

Mr NISC: Multiparty Reusable Non-Interactive Secure Computation. - Fabrice Benhamouda; Huijia Lin (TCC (2), 2020)

Can a Blockchain Keep a Secret? - Fabrice Benhamouda; Craig Gentry; Sergey Gorbunov 001; Shai Halevi; Hugo Krawczyk; Chengyu Lin 001; Tal Rabin; Leonid Reyzin (IACR Cryptol. ePrint Arch., 2020)

Multiparty Reusable Non-Interactive Secure Computation. - Fabrice Benhamouda; Huijia Lin (IACR Cryptol. ePrint Arch., 2020)

On the (in)security of ROS. - Fabrice Benhamouda; Tancrède Lepoint; Michele Orrù; Mariana Raykova 001 (IACR Cryptol. ePrint Arch., 2020)

Corrigendum: Public-key encryption indistinguishable under plaintext-checkable attacks. - Michel Abdalla; Fabrice Benhamouda; David Pointcheval (IET Inf. Secur., 2020)

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation. - Fabrice Benhamouda; Elette Boyle; Niv Gilboa; Shai Halevi; Yuval Ishai; Ariel Nof (IACR Cryptol. ePrint Arch., 2021)

Multiparty Reusable Non-Interactive Secure Computation from LWE. - Fabrice Benhamouda; Aayush Jain; Ilan Komargodski; Huijia Lin (IACR Cryptol. ePrint Arch., 2021)

On the Local Leakage Resilience of Linear Secret Sharing Schemes. - Fabrice Benhamouda; Akshay Degwekar; Yuval Ishai; Tal Rabin (J. Cryptol., 2021)

Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC. - Ghada Almashaqbeh; Fabrice Benhamouda; Seungwook Han; Daniel Jaroslawicz; Tal Malkin; Alex Nicita; Tal Rabin; Abhishek Shah; Eran Tromer (Proc. Priv. Enhancing Technol., 2021)

Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. - Sameer Wagh; Shruti Tople; Fabrice Benhamouda; Eyal Kushilevitz; Prateek Mittal; Tal Rabin (Proc. Priv. Enhancing Technol., 2021)

Threshold Cryptography as a Service (in the Multiserver and YOSO Models). - Fabrice Benhamouda; Shai Halevi; Hugo Krawczyk; Alex Miao; Tal Rabin (CCS, 2022)

Weighted Secret Sharing from Wiretap Channels. - Fabrice Benhamouda; Shai Halevi; Lev Stambler (IACR Cryptol. ePrint Arch., 2022)

Publicly verifiable anonymous tokens with private metadata bit. - Fabrice Benhamouda; Tancrède Lepoint; Michele Orrù; Mariana Raykova 001 (IACR Cryptol. ePrint Arch., 2022)

On the (in)Security of ROS. - Fabrice Benhamouda; Tancrède Lepoint; Julian Loss; Michele Orrù; Mariana Raykova 001 (J. Cryptol., 2022)

Analyzing the Real-World Security of the Algorand Blockchain. - Fabrice Benhamouda; Erica Blum; Jonathan Katz; Derek Leung; Julian Loss; Tal Rabin (IACR Cryptol. ePrint Arch., 2023)

SPRINT: High-Throughput Robust Distributed Schnorr Signatures. - Fabrice Benhamouda; Shai Halevi; Hugo Krawczyk; Tal Rabin; Yiping Ma 001 (IACR Cryptol. ePrint Arch., 2023)

Anonymous Counting Tokens. - Fabrice Benhamouda; Mariana Raykova 001; Karn Seth (IACR Cryptol. ePrint Arch., 2023)

Gold OPRF: Post-Quantum Oblivious Power Residue PRF. - Yibin Yang 001; Fabrice Benhamouda; Shai Halevi; Hugo Krawczyk; Tal Rabin (IACR Cryptol. ePrint Arch., 2024)

Encrypted Matrix-Vector Products from Secret Dual Codes. - Fabrice Benhamouda; Caicai Chen; Shai Halevi; Yuval Ishai; Hugo Krawczyk; Tamer Mour; Tal Rabin; Alon Rosen (IACR Cryptol. ePrint Arch., 2025)

Blockcipher-Based Key Derivation without PRP/PRF Switching. - Fabrice Benhamouda; Shai Halevi; Panos Kampanakis; Hugo Krawczyk (IACR Cryptol. ePrint Arch., 2025)