VLDB 2026 Research / reviewers in the wild / expert
Lingling Lu
dblp:255/9389
· DBLP profile ↗
5ranked-venue papers
2as first author
5since 2021 · last 2024
0000-0003-4454-8046ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 2 · 2 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | ANNProof: Building a verifiable and efficient outsourced approximate nearest neighbor search system on blockchain
Lingling Lu, Zhenyu Wen, Ye Yuan 0001, Qinming He, Jianhai Chen, Zhenguang Liu |
Future Gener. Comput. Syst. | 1 |
| 2024 | Detect Insider Attacks in Industrial Cyber-physical Systems Using Multi-physical Features-based FingerprintingabstractICPS software and hardware suffer from low update frequency, making it easier for insiders to bypass external defenses and launch concealed destructive attacks. To address these concerns, we design a device fingerprinting method based on multi-physical features, augmenting current intrusion detection techniques in the ICPS environment. In this article, we use the sorting system as an example, demonstrating that the proposed device fingerprinting technology has generality in the intrusion detection of ICPS control flow. Specifically, we first formalize the physical model of the sorting system to analyze the critical device features. Then, we extract these physical features from the sensor data collected in a physical testbed. Utilizing featurized data, we train a classifier that generates fingerprints in real-time in the production environment. Moreover, we develop a differential detection model based on device fingerprints to discover stealthy insider attacks efficiently. We evaluate the proposed method in a real-world testbed. Experiment results show that the detecting performance of classifiers approaches 100% when the the number of component types is small. Zhen Hong, Lingling Lu, Dehua Zheng, Jiahui Suo, Raheem A. Beyah, Zhenyu Wen |
ACM Trans. Sens. Networks | 2 |
| 2023 | iQuery: A Trustworthy and Scalable Blockchain Analytics PlatformabstractBlockchain, a distributed and shared ledger, provides a credible and transparent solution to increase application auditability by querying the immutable records written in the ledger. Unfortunately, existing query APIs offered by the blockchain are inflexible and unscalable. Some studies propose off-chain solutions to provide more flexible and scalable query services. However, the query service providers (SPs) may deliver fake results without executing the real computation tasks and collude to cheat users. In this article, we propose a novel intelligent blockchain analytics platform termediQuery, in which we design a game theory based smart contract to ensure the trustworthiness of the query results at a reasonable monetary cost. Furthermore, the contract introduces the second opinion game that employs a randomized SP selection approach coupled with non-ordered asynchronous querying primitive to prevent collusion. We achieve a fixed price equilibrium, destroy the economic foundation of collusion, and can incentivize all rational SPs to act diligently with proper financial rewards. In particular,iQuerycan flexibly support semantic and analytical queries for generic consortium or public blockchains, achieving query scalability to massive blockchain data. Extensive experimental evaluations show thatiQueryis significantly faster than state-of-the-art systems. Specifically, in terms of the conditional, analytical, and multi-origin query semantics,iQueryis 2 ×, 7 ×, and 1.5 × faster than advanced blockchain and blockchain databases. Meanwhile, to guarantee 100% trustworthiness, only two copies of query results need to be verified iniQuery, whileiQuery's latency is$2 \sim 134$× smaller than the state-of-the-art systems. Lingling Lu, Zhenyu Wen, Ye Yuan 0001, Binru Dai, Changting Lin, Qinming He, Zhenguang Liu, Jianhai Chen, Rajiv Ranjan 0001 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2023 | Janus: Latency-Aware Traffic Scheduling for IoT Data Streaming in Edge EnvironmentsabstractThis article focuses on a simple, yet fundamental question of distributed edge computing: “how to handle IoT traffic with different levels of sensitivity and criticality by satisfying the application-specific latency constraints?” This question arises in the practical deployment of edge computing, where user data can arrive at a much faster rate than that they can be processed by an edge node. Addressing this question is critical for meeting the latency requirement for latency-sensitive applications, but existing approaches are inadequate to the problem. We presentJanus, a multi-level traffic scheduling system for managing multiple data streams with various degrees of latency constraints. At the edge node level,Janususes multi-level queues to manage data streams with different latency constraints. It then allocates the output bandwidth of the edge node according to the requirements of applications in different priority queues, aiming to reduce the queuing and processing delay of latency-sensitive streams while maximizing the edge-node throughput. At the network level,Janusactively redirects incoming data streams to the less-loaded ones to achieve better network-wide load balance and improve the overall throughput. Experiments show thatJanusreduces the latency to only 16.6% of a non-priority based solution and improves the throughput by 1.7x of a state-of-the-art priority-aware data stream scheduling approach. Zhenyu Wen, Renyu Yang, Bin Qian 0002, Yubo Xuan, Lingling Lu, Zheng Wang 0001, Hao Peng 0001, Jie Xu 0007, Albert Y. Zomaya, Rajiv Ranjan 0001 |
IEEE Trans. Serv. Comput. | 5 |
| 2023 | Demystifying Random Number in Ethereum Smart Contract: Taxonomy, Vulnerability Identification, and Attack DetectionabstractRecent years have witnessed explosive growth in blockchain smart contract applications. As smart contracts become increasingly popular and carry trillion dollars worth of digital assets, they become more of an appealing target for attackers, who have exploited vulnerabilities in smart contracts to cause catastrophic economic losses. Notwithstanding a proliferation of work that has been developed to detect an impressive list of vulnerabilities, the bad randomness vulnerability is overlooked by many existing tools. In this article, we make the first attempt to provide a systematic analysis of random numbers in Ethereum smart contracts, by investigating the principles behind pseudo-random number generation and organizing them into a taxonomy. We also lucubrate various attacks against bad random numbers and group them into four categories. Furthermore, we presentRNVulDet– a tool that incorporates taint analysis techniques to automatically identify bad randomness vulnerabilities and detect corresponding attack transactions. To extensively verify the effectiveness ofRNVulDet, we construct three new datasets: i) 34 well-known contracts that are reported to possess bad randomness vulnerabilities, ii) 214 popular contracts that have been rigorously audited before launch and are regarded as free of bad randomness vulnerabilities, and iii) a dataset consisting of 47,668 smart contracts and 49,951 suspicious transactions. We compareRNVulDetwith three state-of-the-art smart contract vulnerability detectors, and our tool significantly outperforms them. Meanwhile,RNVulDetspends 2.98 s per contract on average, in most cases orders-of-magnitude faster than other tools.RNVulDetsuccessfully reveals 44,264 attack transactions. Our implementation and datasets are released, hoping to inspire others. Jianting He, Lingling Lu, Siwei Wu, Zhipeng Lu 0001, Lei Wu 0012, Yajin Zhou, Qinming He |
IEEE Trans. Software Eng. | 3 |