default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranck Leprévost
Person information
- affiliation: University of Luxembourg
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Bernardo Pulido-Gaytan
, Andrei Tchernykh, Franck Leprévost, Pascal Bouvry, Alfredo Goldman:
Toward Understanding Efficient Privacy-Preserving Homomorphic Comparison. IEEE Access 11: 102189-102206 (2023)- [j10]Ali Osman Topal, Raluca Chitic, Franck Leprévost:
One evolutionary algorithm deceives humans and ten convolutional neural networks trained on ImageNet at image recognition. Appl. Soft Comput. 143: 110397 (2023) - [j9]Franck Leprévost, Ali Osman Topal, Elmir Avdusinovic, Raluca Chitic:
A strategy creating high-resolution adversarial images against convolutional neural networks and a feasibility study on 10 CNNs. J. Inf. Telecommun. 7(1): 89-119 (2023) - [c11]Franck Leprévost, Ali Osman Topal, Enea Mançellari:
Creating High-Resolution Adversarial Images Against Convolutional Neural Networks with the Noise Blowing-Up Method. ACIIDS (1) 2023: 121-134 - [c10]Panissara Thanapol, Kittichai Lavangnananda, Franck Leprévost, Julien Schleich, Pascal Bouvry:
Scheduling Deep Learning Training in GPU Cluster Using the Model-Similarity-Based Policy. ACIIDS (2) 2023: 363-374 - 2022
- [c9]Franck Leprévost, Ali Osman Topal, Elmir Avdusinovic, Raluca Chitic:
Strategy and Feasibility Study for the Construction of High Resolution Images Adversarial Against Convolutional Neural Networks. ACIIDS (1) 2022: 285-298 - 2021
- [j8]Raluca Chitic, Ali Osman Topal, Franck Leprévost:
Evolutionary Algorithm-Based Images, Humanly Indistinguishable and Adversarial Against Convolutional Neural Networks: Efficiency and Filter Robustness. IEEE Access 9: 160758-160778 (2021) - [j7]Raluca Chitic, Franck Leprévost, Nicolas Bernard:
Evolutionary algorithms deceive humans and machines at image classification: an extended proof of concept on two scenarios. J. Inf. Telecommun. 5(1): 121-143 (2021) - [c8]Raluca Chitic, Nathan Deridder, Franck Leprévost, Nicolas Bernard:
Robustness of Adversarial Images Against Filters. OLA 2021: 101-114 - 2020
- [c7]Raluca Chitic, Nicolas Bernard, Franck Leprévost:
A Proof of Concept to Deceive Humans and Machines at Image Classification with Evolutionary Algorithms. ACIIDS (2) 2020: 467-480 - [c6]Jorge M. Cortés-Mendoza, Andrei Tchernykh, Mikhail G. Babenko, Luis Bernardo Pulido-Gaytan, Gleb I. Radchenko, Franck Leprévost, Xinheng Wang, Arutyun Avetisyan:
Privacy-Preserving Logistic Regression as a Cloud Service Based on Residue Number System. RuSCDays 2020: 598-610
2010 – 2019
- 2018
- [c5]Nicolas Bernard, Franck Leprévost:
Evolutionary Algorithms for Convolutional Neural Network Visualisation. CARLA 2018: 18-32 - 2012
- [j6]Nicolas Bernard, Franck Leprévost:
Hardened Bloom Filters, with an Application to Unobservability. Ann. UMCS Informatica 12(4): 11-22 (2012) - [e1]Pascal Bouvry, Mieczyslaw A. Klopotek, Franck Leprévost, Malgorzata Marciniak, Agnieszka Mykowiecka, Henryk Rybinski:
Security and Intelligent Information Systems - International Joint Conferences, SIIS 2011, Warsaw, Poland, June 13-14, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7053, Springer 2012, ISBN 978-3-642-25260-0 [contents] - 2011
- [j5]Franck Leprévost, Michael Pohst, Osmanbey Uzunkol:
On the Computation of Class Polynomials with "Thetanullwerte" and Its Applications to the Unit Group Computation. Exp. Math. 20(3): 271-281 (2011) - [c4]Nicolas Bernard, Franck Leprévost:
Beyond TOR: The TrueNyms Protocol. SIIS 2011: 68-84
2000 – 2009
- 2009
- [j4]Nicolas Bernard, Franck Leprévost, Michael Pohst:
Jacobians of Genus-2 Curves with a Rational Point of Order 11. Exp. Math. 18(1): 65-70 (2009) - 2005
- [j3]Franck Leprévost, Jean Monnerat, Sébastien Varrette, Serge Vaudenay:
Generating anomalous elliptic curves. Inf. Process. Lett. 93(5): 225-230 (2005) - [c3]Sébastien Varrette, Sebastien Georget, Johan Montagnat, Jean-Louis Roch, Franck Leprévost:
Distributed Authentication in GRID5000. OTM Workshops 2005: 314-326 - 2004
- [c2]Sébastien Varrette, Jean-Louis Roch, Franck Leprévost:
FlowCert : Probabilistic Certification for Peer-to-Peer Computations. SBAC-PAD 2004: 108-115 - 2001
- [j2]E. Victor Flynn, Franck Leprévost, Edward F. Schaefer, William A. Stein, Michael Stoll, Joseph L. Wetherell:
Empirical evidence for the Birch and Swinnerton-Dyer conjectures for modular Jacobians of genus 2 curves. Math. Comput. 70(236): 1675-1697 (2001) - 2000
- [c1]Franck Leprévost, Raphaël Erard, Touradj Ebrahimi:
How to bypass the Wassenaar arrangement: a new application for watermarking. ACM Multimedia Workshops 2000: 161-164
1990 – 1999
- 1993
- [j1]Franck Leprévost:
Courbes modulaires et 11-rang de corps quadratiques. Exp. Math. 2(2): 137-146 (1993)
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 2024-10-07 22:19 CEST 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:
