VLDB 2026 Research / reviewers in the wild / expert
Fabrice Mouhartem
dblp:177/2251
· DBLP profile ↗
8ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 6 · 1 since 2021Theory of computation · 2 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions
Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen |
EUROCRYPT (2) | 4 |
| 2021 | Adaptive oblivious transfer with access control from lattice assumptions
Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen 0002, Huaxiong Wang |
Theor. Comput. Sci. | 3 |
| 2019 | Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen 0002, Huaxiong Wang |
Theor. Comput. Sci. | 3 |
| 2017 | Adaptive Oblivious Transfer with Access Control from Lattice Assumptions
Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen 0002, Huaxiong Wang |
ASIACRYPT (1) | 3 |
| 2016 | A Lattice-Based Group Signature Scheme with Message-Dependent Opening
Benoît Libert, Fabrice Mouhartem, Khoa Nguyen 0002 |
ACNS | 2 |
| 2016 | Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption
Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen 0002, Huaxiong Wang |
ASIACRYPT (2) | 3 |
| 2016 | Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen 0002, Huaxiong Wang |
ASIACRYPT (2) | 3 |
| 2016 | Practical "Signatures with Efficient Protocols" from Simple AssumptionsabstractDigital signatures are perhaps the most important base for authentication and trust relationships in large scale systems. More specifically, various applications of signatures provide privacy and anonymity preserving mechanisms and protocols, and these, in turn, are becoming critical (due to the recently recognized need to protect individuals according to national rules and regulations). A specific type of signatures called "signatures with efficient protocols", as introduced by Camenisch and Lysyanskaya (CL), efficiently accommodates various basic protocols and extensions like zero-knowledge proofs, signing committed messages, or re-randomizability. These are, in fact, typical operations associated with signatures used in typical anonymity and privacy-preserving scenarios. Benoît Libert, Fabrice Mouhartem, Thomas Peters, Moti Yung |
AsiaCCS | 2 |