XueLun Huang

dblp:349/4484 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Cryptographic protocols and secure computation · 75% Privacy and data protection · 25%
Artificial intelligence
1 paper
Deep learning architectures and training · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Privacy and data protection › privacy-preserving machine learning
privacy-preserving machine learning inference
0.812024
SecDM: A Secure and Lossless Human Mobility Prediction System · IEEE Trans. Serv. Comput. 2024
Cryptographic protocols and secure computation
secret sharing
0.812024
SecDM: A Secure and Lossless Human Mobility Prediction System · IEEE Trans. Serv. Comput. 2024
Cryptographic protocols and secure computation › secure inference
secure neural network inference
0.812024
SecDM: A Secure and Lossless Human Mobility Prediction System · IEEE Trans. Serv. Comput. 2024
Cryptographic protocols and secure computation › secure multiparty computation
secure two-party computation
0.812024
SecDM: A Secure and Lossless Human Mobility Prediction System · IEEE Trans. Serv. Comput. 2024
Machine learning › Deep learning architectures and training
recurrent neural network
0.212024
SecDM: A Secure and Lossless Human Mobility Prediction System · IEEE Trans. Serv. Comput. 2024

Methods — techniques the papers use, named apart from their topics

secure multi-party computation protocols · 1.5secret sharing · 1.5
YearPublicationVenuePosition
2024 SecDM: A Secure and Lossless Human Mobility Prediction System
abstract
With the rapid development of deep neural network research, many deep neural network prediction services are provided for cloud service users. However, due to the untrusted nature of cloud computing, there are risks associated with this. To secure user data and cloud servers at the same time, we designed a secure prediction system, named SecDM (SecureDeepMove), which focuses on an attentional recurrent network for human mobility prediction. A neural network inference system that allows two parties to work together securely and efficiently without revealing any data is presented in this work. To design it, with the help of secret sharing technology, we first propose several secure, efficient, and lossless two-party protocols, which can securely calculate non-linear functions in the model, such as sigmoid, tanh, and softmax. In addition, a secure and effective strategy is introduced to maintain the accuracy of the calculation. Moreover, we also prove the security of our scheme in the semi-honest model. Finally, experimental results validate that the prediction result of our SecDM is not only as accurate as the non-privacy-preserving scheme but also highly efficient.
Lin Liu 0018, Shaojing Fu, XueLun Huang, Yuchuan Luo, Xuyun Zhang, Kim-Kwang Raymond Choo
IEEE Trans. Serv. Comput.3
2023 BFCRI: A Blockchain-Based Framework for Crowdsourcing With Reputation and Incentive
abstract
With the rapid development of cloud computing and the sharing economy, crowdsourcing aroused widespread interest and adoption in providing intelligent and efficient services for humans. The majority of existing works focus on effective crowdsourcing task assignment and privacy protection, mostly relying on central servers and assuming that participants are$honest$-$and$-$curious$and proactive. However, in reality, workers may be unwilling to participate, and there may be malicious behavior among participants, thus harming the enthusiasm and interests of other participants. The central server has weaknesses such as single point of failure. To address above problems, we propose a blockchain-based framework for crowdsourcing with reputation and incentive. We first design a worker selection scheme to select credible and capable workers. We leverage reputation as a metric of workers’ credibility, which is calculated through the improved subjective logic model. Then we utilize contract theory to design incentive mechanisms to attract more workers, especially high-quality workers to participate. Experimental results show that our proposed method can detect and prevent malicious participants and resist malicious collusion when the proportion of malicious participants is no more than 1/3. And encourage more workers to actively, honestly and continuously participate in crowdsourcing.
Shaojing Fu, XueLun Huang, Lin Liu 0018, Yuchuan Luo
IEEE Trans. Cloud Comput.2