Homomorphic Encryption Based Privacy Protection Scheme Design for Tourism Big Data

With the rapid development of tourism big data, data privacy and security issues are becoming more and more prominent. Traditional encryption technology is risky due to the need to decrypt the ciphertext, while full homomorphic encryption is difficult to be applied in practice due to high computation and storage costs. In this paper, we propose a privacy protection scheme based on homomorphic encryption for tourism big data, which combines federated learning and blockchain dynamic authorisation mechanism with dynamic encryption layer selection algorithm to optimise privacy protection and computational efficiency. The scheme adopts BFV homomorphic encryption algorithm, optimises the key generation process (the key size is compressed to 45MB), and integrates Microsoft SEAL library to build an efficient homomorphic computing engine. The solution supports high concurrent processing of ten million data in hybrid cloud environment, privacy protection is increased, and the loss of analytical accuracy of encrypted data in SVM and XGBoost model is reduced by 4.1%. GDPR compliance requirements are met by introducing spatio-temporal indexed encryption with lightweight key proxy services. The research provides a secure and efficient solution for multimodal data analysis in tourism scenarios, which will be further combined with hardware acceleration and standardised integration in the future to promote privacy-preserving practices in smart tourism.

Authors

Institutions

Publication Details

Published
2025-07-11
DOI
https://doi.org/10.1109/cisat66811.2025.11181760
Primary Topic
E-commerce and Technology Innovations
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Homomorphic Encryption Based Privacy Protection Scheme Design for Tourism Big Data

Benoît You, Pan Jiang, Yang Gao, Kaiyu Li et al.
E-commerce and Technology Innovations
article

Homomorphic Encryption Based Privacy Protection Scheme Design for Tourism Big Data

Benoît You, Pan Jiang, Yang Gao, Kaiyu Li, Shichong Nie
article en

Abstract

With the rapid development of tourism big data, data privacy and security issues are becoming more and more prominent. Traditional encryption technology is risky due to the need to decrypt the ciphertext, while full homomorphic encryption is difficult to be applied in practice due to high computation and storage costs. In this paper, we propose a privacy protection scheme based on homomorphic encryption for tourism big data, which combines federated learning and blockchain dynamic authorisation mechanism with dynamic encryption layer selection algorithm to optimise privacy protection and computational efficiency. The scheme adopts BFV homomorphic encryption algorithm, optimises the key generation process (the key size is compressed to 45MB), and integrates Microsoft SEAL library to build an efficient homomorphic computing engine. The solution supports high concurrent processing of ten million data in hybrid cloud environment, privacy protection is increased, and the loss of analytical accuracy of encrypted data in SVM and XGBoost model is reduced by 4.1%. GDPR compliance requirements are met by introducing spatio-temporal indexed encryption with lightweight key proxy services. The research provides a secure and efficient solution for multimodal data analysis in tourism scenarios, which will be further combined with hardware acceleration and standardised integration in the future to promote privacy-preserving practices in smart tourism.

Wuhan Business University (CN)
Openalex Percentile: Top 49%
E-commerce and Technology Innovations
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.