EDBT 2026 Demo / reviewers in the wild / expert
Shimeng Lu
dblp:372/4904
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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 · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation › private set intersection
multi-party private set intersection |
0.9 | 1 | 2025 | Multi-Party Private Set Intersection With One-Round Online Interaction · IEEE Trans. Inf. Forensics Secur. 2025 |
Cryptographic protocols and secure computation › private set intersection
oblivious key-value store |
0.9 | 1 | 2025 | Multi-Party Private Set Intersection With One-Round Online Interaction · IEEE Trans. Inf. Forensics Secur. 2025 |
Cryptographic protocols and secure computation › secure computation primitives
oblivious linear function evaluation |
0.9 | 1 | 2025 | Multi-Party Private Set Intersection With One-Round Online Interaction · IEEE Trans. Inf. Forensics Secur. 2025 |
Cryptographic protocols and secure computation
private set intersection |
0.9 | 1 | 2025 | Multi-Party Private Set Intersection With One-Round Online Interaction · IEEE Trans. Inf. Forensics Secur. 2025 |
Methods — techniques the papers use, named apart from their topics
ring oblivious linear-function evaluation · 0.9precomputation · 0.9dual-core star structure · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Multi-Party Private Set Intersection With One-Round Online InteractionabstractMulti-party private set intersection (PSI) enables multiple parties to compute the common items of private sets without disclosing any other information beyond the result; thus, it has gained significant importance in various distributed computation scenarios. As the number of participants increases, the performance of multi-party PSI protocols is significantly influenced, primarily by the number of interaction rounds needed. In this study, we propose two novel multi-party PSI protocols: the first one is 1MPSI, and the second is 2MPSI. The 1MPSI appears as a wheel structure where the parties need only one round of interactive communication online. 1MPSI is based on the Ring version of Oblivious Linear-function Evaluation (OLE). Benefiting from the wheel structure, 1MPSI supports parallel computation and achieves competitive efficiency between the leader and the other participants (OLE receivers) after input-independent precomputation. The 2MPSI adopts a dual-core star structure and introduces Oblivious Key-Value Store (OKVS), which results in better performance when handling larger set sizes and more participants. Our protocols are designed with simplicity and ease of implementation in mind. Experimental evaluations demonstrate the superiority of our protocols over current open-source multi-party PSI protocols as the set size increases from 212to 220when involving 10 and 16 parties. In a test with 16 parties each inputting 220elements, 2MPSI achieves a runtime of only 65 seconds. Shimeng Lu, Shan Jing, Qiuliang Xu |
IEEE Trans. Inf. Forensics Secur. | 2 |
| 2024 | Infrastructure-Assisted Collaborative Perception in Automated Valet Parking: A Safety PerspectiveabstractEnvironmental perception in Automated Valet Parking (AVP) has been a challenging task due to severe occlusions in parking garages. Although Collaborative Perception (CP) can be applied to broaden the field of view of connected vehicles, the limited bandwidth of vehicular communications restricts its application. In this work, we propose a BEV feature-based CP network architecture for infrastructure-assisted AVP systems. The model takes the roadside camera and LiDAR as optional inputs and adaptively fuses them with onboard sensors in a unified BEV representation. Autoencoder and downsampling are applied for channel-wise and spatial-wise dimension reduction, while sparsification and quantization further compress the feature map with little loss in data precision. Combining these techniques, the size of a BEV feature map is effectively compressed to fit in the feasible data rate of the NR-V2X network. With the synthetic AVP dataset, we observe that CP can effectively increase perception performance, especially for pedestrians. Moreover, the advantage of infrastructure-assisted CP is demonstrated in two typical safety-critical scenarios in the AVP setting, increasing the maximum safe cruising speed by up to 3m/s in both scenarios. Yukuan Jia, Shimeng Lu, Baokang Fan, Ruiqing Mao, Sheng Zhou 0001, Zhisheng Niu |
VTC Spring | 3 |