Jacques Traore

Dr. Jacques Traore


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 September 2021
Verified
Book Chapter
Closed access
PDF file
GKGuillaume Kaim
Guillaume Kaim
SCSébastien Canard
Sébastien Canard
ARAdeline Roux-Langlois
Adeline Roux-Langlois
JTJacques Traore
Jacques Traore

17 May 2017
Verified
Book Chapter
Closed access
PDF file
ABAmira Barki
Amira Barki
SBSolenn Brunet
Solenn Brunet
NDNicolas Desmoulins
Nicolas Desmoulins
SGSébastien Gambs
Sébastien Gambs
SGSaïd Gharout
Saïd Gharout
JTJacques Traore
Jacques Traore

17 October 2022 in Cryptography
Verified
Journal Article
Open access
PDF file
GAGhada Arfaoui
Ghada Arfaoui
GAGildas Avoine
Gildas Avoine
OGOlivier Gimenez
Olivier Gimenez
JTJacques Traore
Jacques Traore
Traffic hijacking over the Internet has become a frequent incident over the last two decades. From minor inconveniences for casual users to massive leaks of governmental data, these events cover an unprecedently large spectrum. Many hijackings are presumed to be caused by unfortunate routing mistakes, but a well-organized attacker could set up a long-term stealthy relay, accessing critical traffic metadata, despite suitable encryption schemes. While many studies focus on the mitigation of known attacks, we choose to design a complete detection method regardless of the attacker’s strategy. We propose a two-party cryptographic protocol for detecting traffic hijacking over the Internet. Our proposal relies on a distance-bounding mechanism that performs interactive authentication with a “Challenge–Response” exchange, and measures the round-trip time of packets to decide whether an attack is ongoing. Our construction is supported by worldwide experiments on communication time between multiple nodes, allowing us to both demonstrate its applicability and evaluate its performance. Over the course of this paper, we demonstrate our protocol to be efficient—itrequires only two cryptographic operations per execution inducing negligible workload for users and very few loss of throughput, scalable—no software updates are required for intermediate network nodes, routing protocol independent—this means that any future update of the route selection process will not induce changes on our scheme, and network friendly—the added volume of transiting data is only about 1.5%.

25 October 2018
Verified
Conference Paper
Open access
PDF file
RARoberto Araujo
Roberto Araujo
ANAndré Neto
André Neto
JTJacques Traore
Jacques Traore
Coercion is an intrinsic problem of Internet elections that certainly prevent its wide use. Although there is no optimal solution for this problem, modern cryptographic election schemes can mitigate it. Most of these proposals, however, were never used to carry out real elections due to the lack of software implementations. As a result, it is not possible to test these schemes in realistic election scenarios and so their interest remain purely theoretical. In this context, this work introduces the CIVIS election system. CIVIS is a web-based system that implements ideas to fight coercive attacks. It is based on a secure coercion-resistant election scheme and it shows the applicability of this scheme to accomplish realistic elections. Besides introducing CIVIS, we show that a famous Internet-based election system used in Brazil does not satisfy important security properties for voting.

1 January 2025 in HAL
Verified
Preprint
Open access
PDF file
DLDivi De Lacour
Divi De Lacour
MLMarc Lacoste
Marc Lacoste
MSMario Südholt
Mario Südholt
JTJacques Traore
Jacques Traore
Recently, the costs of training deep learning models have dramatically increased. Volunteer Computing (VC) enables cost-effective gathering of large amounts of idle computing resources, but has been little applied to deep learning. Volunteer Deep Learning (VDL) applies VC to train deep learning models while keeping costs low. In this paper we review current VDL concepts, projects, challenges and opportunities. We analyze the VDL security challenges and countermeasures. We propose guidelines towards a VDL framework implementation based on decentralized federated learning.

12 May 2015 in arXiv
Verified
Preprint
Open access
PDF file
GAGhada Arfaoui
Ghada Arfaoui
JLJean-Francois Lalande
Jean-Francois Lalande
JTJacques Traore
Jacques Traore
NDNicolas Desmoulins
Nicolas Desmoulins
PBPascal Berthomé
Pascal Berthomé
SGSaïd Gharout
Saïd Gharout
To ensure the privacy of users in transport systems, researchers are working on new protocols providing the best security guarantees while respecting functional requirements of transport operators. In this paper, we design a secure NFC m-ticketing protocol for public transport that preserves users' anonymity and prevents transport operators from tracing their customers' trips. To this end, we introduce a new practical set-membership proof that does not require provers nor verifiers (but in a specific scenario for verifiers) to perform pairing computations. It is therefore particularly suitable for our (ticketing) setting where provers hold SIM/UICC cards that do not support such costly computations. We also propose several optimizations of Boneh-Boyen type signature schemes, which are of independent interest, increasing their performance and efficiency during NFC transactions. Our m-ticketing protocol offers greater flexibility compared to previous solutions as it enables the post-payment and the off-line validation of m-tickets. By implementing a prototype using a standard NFC SIM card, we show that it fulfils the stringent functional requirement imposed by transport operators whilst using strong security parameters. In particular, a validation can be completed in 184.25 ms when the mobile is switched on, and in 266.52 ms when the mobile is switched off or its battery is flat.