Fabrice Benhamouda
Orcid: 0000-0002-8300-1820Affiliations:
- 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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2023
IACR Cryptol. ePrint Arch., 2023
IACR Cryptol. ePrint Arch., 2023
2022
IACR Cryptol. ePrint Arch., 2022
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022
2021
Proc. Priv. Enhancing Technol., 2021
Proc. Priv. Enhancing Technol., 2021
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
IACR Cryptol. ePrint Arch., 2020
Proceedings of the Theory of Cryptography - 18th International Conference, 2020
Proceedings of the Theory of Cryptography - 18th International Conference, 2020
2019
IBM J. Res. Dev., 2019
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
J. Cryptol., 2018
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
J. Cryptol., 2017
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Non-Interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms.
IACR Cryptol. ePrint Arch., 2017
IACR Cryptol. ePrint Arch., 2017
Algebraic XOR-RKA-Secure Pseudorandom Functions from Post-Zeroizing Multilinear Maps.
IACR Cryptol. ePrint Arch., 2017
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017
2016
ACM Trans. Inf. Syst. Secur., 2016
IET Inf. Secur., 2016
Easing Coppersmith Methods using Analytic Combinatorics: Applications to Public-Key Cryptography with Weak Pseudorandomness.
IACR Cryptol. ePrint Arch., 2016
IACR Cryptol. ePrint Arch., 2016
2015
IACR Cryptol. ePrint Arch., 2015
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
IACR Cryptol. ePrint Arch., 2015
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
IACR Cryptol. ePrint Arch., 2014
IACR Cryptol. ePrint Arch., 2014
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
IACR Cryptol. ePrint Arch., 2013
IACR Cryptol. ePrint Arch., 2013
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
Proceedings of the Trustworthy Global Computing - 7th International Symposium, 2012