EDBT 2026 Demo / reviewers in the wild / expert
Haina Song
dblp:217/5415
· DBLP profile ↗
8ranked-venue papers
5as first author
5since 2021 · last 2025
0000-0001-6973-2267ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 2 first-author · 1 since 2021Security and privacy · 3 · 3 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A dense pyramid convolutional neural network for MRI brain tumor segmentation
Haina Song, Honggang Xie |
J. Supercomput. | 2 |
| 2024 | APLDP: Adaptive personalized local differential privacy data collection in mobile crowdsensing
Haina Song, Hua Shen 0006, Nan Zhao 0006, Zhangqing He, Minghu Wu, Wei Xiong 0004, Mingwu Zhang |
Comput. Secur. | 1 |
| 2022 | MPDS-RCA: Multi-level privacy-preserving data sharing for resisting collusion attacks based on an integration of CP-ABE and LDP
Haina Song, Fangfang Yin, Tao Luo 0005, Jianfeng Li 0004 |
Comput. Secur. | 1 |
| 2022 | MPLDS: An integration of CP-ABE and local differential privacy for achieving multiple privacy levels data sharing
Haina Song, Tao Luo 0005, Jianfeng Li 0004 |
Peer-to-Peer Netw. Appl. | 1 |
| 2022 | Local Trajectory Privacy Protection in 5G Enabled Industrial Intelligent LogisticsabstractThe value of trajectory data lies mainly in the spatio-temporal correlation. However, the existing privacy protection methods ignore the spatio-temporal correlation of trajectory data, resulting in a large error in trajectory proportion estimation and Top-K classification. For the privacy of truck trajectory in intelligent logistics, the location and trajectory data perturbation method based on quadtree indexing is proposed, which leverages location generalization and local differential privacy techniques. Our proposed algorithms are suitable for datasets with a large sample space and can protect the trajectory privacy of truck drivers while preserving the strong correlation between adjacent spatio-temporal nodes in the trajectory. The results of simulation on a real trajectory dataset show that the proposed methods not only meet the trajectory privacy requirements of users but also have a good performance in trajectory proportion estimation and Top-K classification. Zhigang Yang 0001, Ruyan Wang, Dapeng Wu 0002, Honggang Wang 0001, Haina Song, Xinqiang Ma |
IEEE Trans. Ind. Informatics | 5 |
| 2020 | Enhanced anonymous models for microdata release based on sensitive levels partition
Haina Song, Jinkao Sun, Tao Luo 0005, Jianfeng Li 0004 |
Comput. Commun. | 1 |
| 2020 | Multiple Sensitive Values-Oriented Personalized Privacy Preservation Based on Randomized ResponseabstractIn the case where the private data is not equally important, personalized local privacy preservation based on randomized response (RR) is studied in the collection of sensitive data. So far, the existing RR mechanisms for multiple discrete private sources, which are termed as conventional randomized response (CRR) mechanisms, focus on a universal approach that exerts the same amount of privacy preservation for all sensitive values, without catering for their concrete privacy requirements. An immediate consequence is that they may be offering insufficient protection to a subset of data contributors with relatively higher privacy requirements, while applying excessive privacy control to another subset with relatively lower privacy requirements. Motivated by this, a novel perturbation framework, which is termed as personalized randomized response (PRR) mechanism, is proposed to achieve personalized privacy preservation (Personalized-PP) by designing the statistical privatization mechanism for multiple sensitive values. The proposed PRR technique introduces the weights for different sensitive values according to their sensitivity, and then introduces the weights into the decision of PRR by considering the concrete requirements for privacy, and thus, attains a higher data utility with respect to the quality of statistics while guaranteeing Personalized-PP. The estimate error of the private distribution is used to measure the quality of statistics for the two RR mechanisms. Theoretical study shows that the estimate error of PRR mechanism is smaller than that of the CRR mechanism for a certain same subjective privacy leakage degree. In particular, simulation results reveal the circumstances where CRR mechanism fails to provide Personalized-PP, and then establish the superiority of PRR mechanism. Haina Song, Tao Luo 0005, Jianfeng Li 0004 |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2018 | Multi-relay cooperative transmission based on rateless codes and adaptive demodulationabstractA rate adaption scheme is given at the receiver using rateless codes and log‐likelihood ratio (LLR) threshold‐based adaptive demodulation (ADM). The received bits with LLR absolute values higher than the preset threshold are demodulated by the receiver, otherwise, deleted. Through the theoretical analysis of the average mutual information (MI) of the demodulated bits, the method is obtained to calculate the LLR demodulation threshold under the required error performance after decoding and the constraint of codeword length for decoding. Then, the rate adaption scheme is applied in a parallel multiple relay wireless communication system. The LLR threshold is set according to the instantaneous SNR of the received signals in order to keep the average MI per demodulated bit of each relay link the same. The demodulated bits coming from all links are combined for decoding. The 256‐QAM constellation and Raptor code are then considered as a special case to design a sample scheme. Simulation results prove the correctness of the theoretical analysis and the feasibility of the proposed scheme, and when it is employed by a multi‐relay transmission system, the diversity gain can be obtained, and the anti‐fading and the anti‐jamming abilities of the system are promoted. Weijia Lei, Haina Song |
IET Commun. | 2 |