default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrice Mouhartem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen:
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions. EUROCRYPT (2) 2024: 219-248- [i4]Rafaël Del Pino, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Markku-Juhani O. Saarinen:
Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions. IACR Cryptol. ePrint Arch. 2024: 184 (2024) - 2021
- [j2]Benoît Libert, San Ling
, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Adaptive oblivious transfer with access control from lattice assumptions. Theor. Comput. Sci. 891: 210-229 (2021) - 2020
- [i3]Shweta Agrawal, Rishab Goyal, Fabrice Mouhartem:
Multi-Party Functional Encryption. IACR Cryptol. ePrint Arch. 2020: 1266 (2020)
2010 – 2019
- 2019
- [j1]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption. Theor. Comput. Sci. 759: 72-97 (2019) - 2018
- [b1]Fabrice Mouhartem:
Privacy-preserving cryptography from pairings and lattices. (Cryptographie protégeant la vie privée à base de couplages et de réseaux). University of Lyon, France, 2018 - 2017
- [c5]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Adaptive Oblivious Transfer with Access Control from Lattice Assumptions. ASIACRYPT (1) 2017: 533-563 - 2016
- [c4]Benoît Libert, Fabrice Mouhartem, Khoa Nguyen:
A Lattice-Based Group Signature Scheme with Message-Dependent Opening. ACNS 2016: 137-155 - [c3]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. ASIACRYPT (2) 2016: 101-131 - [c2]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. ASIACRYPT (2) 2016: 373-403 - [c1]Benoît Libert, Fabrice Mouhartem, Thomas Peters, Moti Yung:
Practical "Signatures with Efficient Protocols" from Simple Assumptions. AsiaCCS 2016: 511-522 - [i2]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions. IACR Cryptol. ePrint Arch. 2016: 101 (2016) - [i1]Benoît Libert, San Ling, Fabrice Mouhartem, Khoa Nguyen, Huaxiong Wang:
Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption. IACR Cryptol. ePrint Arch. 2016: 879 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
