Fabrice Benhamouda

Orcid: 0000-0002-8300-1820

Affiliations:
  • IBM Research, Yorktown Heights, NY, USA
  • École Normale Supérieure, Paris, France (PhD 2016)
  • PSL Research University, Paris, France (PhD 2016)


According to our database1, Fabrice Benhamouda authored at least 58 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Anonymous Counting Tokens.
IACR Cryptol. ePrint Arch., 2023

SPRINT: High-Throughput Robust Distributed Schnorr Signatures.
IACR Cryptol. ePrint Arch., 2023

Analyzing the Real-World Security of the Algorand Blockchain.
IACR Cryptol. ePrint Arch., 2023

2022
On the (in)Security of ROS.
J. Cryptol., 2022

Publicly verifiable anonymous tokens with private metadata bit.
IACR Cryptol. ePrint Arch., 2022

Weighted Secret Sharing from Wiretap Channels.
IACR Cryptol. ePrint Arch., 2022

Threshold Cryptography as a Service (in the Multiserver and YOSO Models).
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning.
Proc. Priv. Enhancing Technol., 2021

Gage MPC: Bypassing Residual Function Leakage for Non-Interactive MPC.
Proc. Priv. Enhancing Technol., 2021

On the Local Leakage Resilience of Linear Secret Sharing Schemes.
J. Cryptol., 2021

Multiparty Reusable Non-Interactive Secure Computation from LWE.
IACR Cryptol. ePrint Arch., 2021

Generalized Pseudorandom Secret Sharing and Efficient Straggler-Resilient Secure Computation.
IACR Cryptol. ePrint Arch., 2021

2020
Corrigendum: Public-key encryption indistinguishable under plaintext-checkable attacks.
IET Inf. Secur., 2020

On the (in)security of ROS.
IACR Cryptol. ePrint Arch., 2020

Multiparty Reusable Non-Interactive Secure Computation.
IACR Cryptol. ePrint Arch., 2020

Can a Blockchain Keep a Secret?
IACR Cryptol. ePrint Arch., 2020

Mr NISC: Multiparty Reusable Non-Interactive Secure Computation.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Can a Public Blockchain Keep a Secret?
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
On the Tightness of Forward-Secure Signature Reductions.
J. Cryptol., 2019

Supporting private data on Hyperledger Fabric with secure multiparty computation.
IBM J. Res. Dev., 2019

Decentralizing Inner-Product Functional Encryption.
IACR Cryptol. ePrint Arch., 2019

From Single-Input to Multi-Client Inner-Product Functional Encryption.
IACR Cryptol. ePrint Arch., 2019

Initial Public Offering (IPO) on Permissioned Blockchain Using Secure Multiparty Computation.
Proceedings of the IEEE International Conference on Blockchain, 2019

2018
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier.
J. Cryptol., 2018

How to Profile Privacy-Conscious Users in Recommender Systems.
CoRR, 2018

Two-Round Adaptively Secure Multiparty Computation from Standard Assumptions.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits.
Proceedings of the Advances in Cryptology - EUROCRYPT 2018 - 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29, 2018

2017
Efficient Cryptosystems From 2<sup>k</sup>-th Power Residue Symbols.
J. Cryptol., 2017

k-Round MPC from k-Round OT via Garbled Interactive Circuits.
IACR Cryptol. ePrint Arch., 2017

Robust Non-Interactive Multiparty Computation Against Constant-Size Collusion.
IACR Cryptol. ePrint Arch., 2017

Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms.
IACR Cryptol. ePrint Arch., 2017

CCA-Secure Inner-Product Functional Encryption from Projective Hash Functions.
IACR Cryptol. ePrint Arch., 2017

Hash Proof Systems over Lattices Revisited.
IACR Cryptol. ePrint Arch., 2017

Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps.
IACR Cryptol. ePrint Arch., 2017

Private Multiplication over Finite Fields.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

2016
Diverse modules and zero-knowledge.
PhD thesis, 2016

A New Framework for Privacy-Preserving Aggregation of Time-Series Data.
ACM Trans. Inf. Syst. Secur., 2016

Public-key encryption indistinguishable under plaintext-checkable attacks.
IET Inf. Secur., 2016

Optimization of Bootstrapping in Circuits.
IACR Cryptol. ePrint Arch., 2016

Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2016

Randomness Complexity of Private Circuits for Multiplication.
IACR Cryptol. ePrint Arch., 2016

2015
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting.
IACR Cryptol. ePrint Arch., 2015

New Techniques for SPHFs and Efficient One-Round PAKE Protocols.
IACR Cryptol. ePrint Arch., 2015

Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security.
IACR Cryptol. ePrint Arch., 2015

An Algebraic Framework for Pseudorandom Functions and Applications to Related-Key Security.
IACR Cryptol. ePrint Arch., 2015

Tighter Reductions for Forward-Secure Signature Schemes.
IACR Cryptol. ePrint Arch., 2015

Security of the J-PAKE Password-Authenticated Key Exchange Protocol.
Proceedings of the 2015 IEEE Symposium on Security and Privacy, 2015

2014
Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings.
IACR Cryptol. ePrint Arch., 2014

SPOKE: Simple Password-Only Key Exchange in the Standard Model.
IACR Cryptol. ePrint Arch., 2014

Disjunctions for Hash Proof Systems: New Constructions and Applications.
IACR Cryptol. ePrint Arch., 2014

Removing Erasures with Explainable Hash Proof Systems.
IACR Cryptol. ePrint Arch., 2014

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Trapdoor Smooth Projective Hash Functions.
IACR Cryptol. ePrint Arch., 2013

New Smooth Projective Hash Functions and One-Round Authenticated Key Exchange.
IACR Cryptol. ePrint Arch., 2013

Verifier-Based Password-Authenticated Key Exchange: New Models and Constructions.
IACR Cryptol. ePrint Arch., 2013

SPHF-Friendly Non-Interactive Commitments.
IACR Cryptol. ePrint Arch., 2013

Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages.
Proceedings of the Public-Key Cryptography - PKC 2013 - 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26, 2013

2012
From Rational Number Reconstruction to Set Reconciliation and File Synchronization.
Proceedings of the Trustworthy Global Computing - 7th International Symposium, 2012


  Loading...