Derong Shen

Prof. Derong Shen


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
20 August 2013 in Journal of Software
Verified
Journal Article
Closed access
DSDerong Shen
Derong Shen
GYGe Yu
Ge Yu
XWXi-Te Wang
Xi-Te Wang
TNTie-Zheng Nie
Tie-Zheng Nie
YKYue Kou
Yue Kou

12 March 2013 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
DYDan Yang
Dan Yang
DSDerong Shen
Derong Shen
GYGe Yu
Ge Yu
YKYue Kou
Yue Kou
TNTie-Zheng Nie
Tie-Zheng Nie

2 December 2015 in World Wide Web
Verified
Journal Article
Closed access
PDF file
JSJing Shan
Jing Shan
DSDerong Shen
Derong Shen
TNTiezheng Nie
Tiezheng Nie
YKYue Kou
Yue Kou
GYGe Yu
Ge Yu

14 June 2024 in Mathematics
Verified
Journal Article
Open access
PDF file
SHShumin Han
Shumin Han
WKWang Kang
Wang Kang
DSDerong Shen
Derong Shen
CWChuang Wang
Chuang Wang
Privacy-preserving record linkage (PPRL) is the process of linking records from various data sources, ensuring that matching records for the same entity are shared among parties while not disclosing other sensitive data. However, most existing PPRL approaches currently rely on third parties for linking, posing risks of malicious tampering and privacy breaches, making it difficult to ensure the security of the linkage. Therefore, we propose a parallel multi-party PPRL method based on consortium blockchain technology which can effectively address the issue of semi-trusted third-party validation, auditing all parties involved in the PPRL process for potential malicious tampering or attacks. To improve the efficiency and security of consensus within a consortium blockchain, we propose a practical Byzantine fault tolerance consensus algorithm based on matching efficiency. Additionally, we have incorporated homomorphic encryption into Bloom filter encoding to enhance its security. To optimize computational efficiency, we have adopted the MapReduce model for parallel encryption and utilized a binary storage tree as the data structure for similarity computation. The experimental results show that our method can effectively ensure data security while also exhibiting relatively high linkage quality and scalability.

22 April 2022 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
SHShumin Han
Shumin Han
DSDerong Shen
Derong Shen
TNTiezheng Nie
Tiezheng Nie
YKYue Kou
Yue Kou
GYGe Yu
Ge Yu

9 September 2016 in Journal of Computer Science and Technology
Verified
Journal Article
Closed access
PDF file
CSChen-Chen Sun
Chen-Chen Sun
DSDerong Shen
Derong Shen
YKYue Kou
Yue Kou
TNTie-Zheng Nie
Tie-Zheng Nie
GYGe Yu
Ge Yu