Cited by 2Privacy-Preserving Technologies in DataCryptography and Data SecurityInternet Traffic Analysis and Secure E-voting

PRIV-DRIVE: Privacy-Ensured Federated Learning using Homomorphic Encryption for Driver Fatigue Detection

Sinaei, Sima, Mohammadi, Mohammadreza, Shrestha, Rakesh, Alibeigi, Mina, Eklund, David·2024·2024 27th Euromicro Conference on Digital System Design (DSD)

Abstract

Context: Detecting fatigue in drivers has become increasingly important for safe driving, especially with the use of more smart devices and Internet-connected vehicles. While sharing data between vehicles can enhance fatigue detection systems, privacy concerns pose significant barriers to this sharing process. We propose a Federated Learning (FL) approach for monitoring fatigue-driven behavior to address these challenges. However, there is a concern that the drivers' private information might be leaked in the FL system. In this paper, we introduce PRIV-DRIVE, a novel approach for privacy-enhanced fatigue detection applications. Our method integrates Paillier homo-morphic encryption (PHE) with a top-k parameter selection technique, bolstering privacy and confidentiality in federated fatigue detection systems. This approach reduces communication and computation overhead while ensuring model accuracy. To the best of our knowledge, this is the first paper to implement PHE in FL setups for fatigue detection applications. We ran several experiments and evaluated the PRIV-DRIVE method. The results show substantial efficiency gains with different HE key sizes, reducing computation time by up to 96% and communication traffic by up to 95%. Importantly, these improvements have minimal impact on accuracy, effectively meeting the requirements of fatigue detection applications.

Integrity signals

Registry

Crossref · 10.1109/dsd64264.2024.00063

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Sinaei, S., Mohammadi, M., Shrestha, R., Alibeigi, M., & Eklund, D.
Affiliations
  • RISE Research Institutes of Sweden (SE)
  • Zenseact,Sweden
Venue
2024 27th Euromicro Conference on Digital System Design (DSD)
Publisher
IEEE
Published
2024-08-28
Pages
427-434
OpenAlex
W4404101787
Cited by
2
References
4
Citations by year
2026: 1 · 2025: 1
FWCI
0.58
Type
conference paper
Language
en
Open access
closed
Locations
Euromicro Conference on Digital System Design (DSD) (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
Keywords
driver fatigue detection, federated learning, homomorphic encryption, Paillier cryptosystem, privacy preservation, communication efficiency, computational overhead, driver behavior monitoring

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review