EDBT 2026 Demo / reviewers in the wild / expert
Yeting Wu
dblp:390/4731
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 2 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
2 papers |
Cryptographic primitives and cryptanalysis · 95% Authentication and access control · 5% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis › searchable encryption › searchable symmetric encryption
dynamic searchable symmetric encryption |
2.0 | 2 | 2026 | Verifiable Multi-User Dynamic Searchable Symmetric Encryption With Forward and Backward Privacy Feasible for Cloud Storage · IEEE Trans. Inf. Forensics Secur. 2026 Traceable and Revocable Dynamic Searchable Symmetric Encryption With Forward Privacy and Conjunctive Query for Internet of Vehicles · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis
searchable encryption |
2.0 | 2 | 2026 | Verifiable Multi-User Dynamic Searchable Symmetric Encryption With Forward and Backward Privacy Feasible for Cloud Storage · IEEE Trans. Inf. Forensics Secur. 2026 Traceable and Revocable Dynamic Searchable Symmetric Encryption With Forward Privacy and Conjunctive Query for Internet of Vehicles · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis › searchable encryption › multi-keyword search
conjunctive keyword search |
1.0 | 1 | 2026 | Traceable and Revocable Dynamic Searchable Symmetric Encryption With Forward Privacy and Conjunctive Query for Internet of Vehicles · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic primitives and cryptanalysis › searchable encryption
forward privacy |
1.0 | 1 | 2026 | Traceable and Revocable Dynamic Searchable Symmetric Encryption With Forward Privacy and Conjunctive Query for Internet of Vehicles · IEEE Trans. Dependable Secur. Comput. 2026 |
Cloud and datacenter computing
cloud storage |
0.3 | 1 | 2026 | Verifiable Multi-User Dynamic Searchable Symmetric Encryption With Forward and Backward Privacy Feasible for Cloud Storage · IEEE Trans. Inf. Forensics Secur. 2026 |
Cloud and datacenter computing › cloud storage
encrypted cloud storage |
0.3 | 1 | 2026 | Verifiable Multi-User Dynamic Searchable Symmetric Encryption With Forward and Backward Privacy Feasible for Cloud Storage · IEEE Trans. Inf. Forensics Secur. 2026 |
Methods — techniques the papers use, named apart from their topics
workload proof · 2.0homomorphic addition · 2.0bitmap indexing · 2.0t-puncturable pseudorandom function · 1.0inverted index · 1.0accumulative verification label · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Traceable and Revocable Dynamic Searchable Symmetric Encryption With Forward Privacy and Conjunctive Query for Internet of VehiclesabstractTo achieve the sharing of traffic data with other vehicles, the related data of the Internet of Vehicles (IoV) normally have to be uploaded to the cloud server. Dynamic searchable symmetric encryption (DSSE) empowers users to perform retrieve operations on encrypted databases preserved on cloud servers and supports dynamic data updates at the same time. However, most of the DSSE solutions that support forward privacy and only supply single-keyword search, which places a limit on the practical implementations. When the data owner discloses data to shared users, licensed users might sell their private keys to achieve economic benefits. Based on the aforementioned issues, we put forward traceable and revocable dynamic searchable symmetric encryption with forward privacy and conjunctive query (TR-DSSE-FC), this scheme supports efficient conjunctive-query and the tracking and revocation of malicious users while ensuring forward privacy. This scheme realizes the conjunctive query function by integrating the inverted index with the forward index. The inverted index is deployed to extract the documents that align the least frequent items, while the forward index constructed based on t-puncturable pseudorandom functions (t-Pun-PRFs) is responsible for determining the final query results. To verify whether the search results generated by the cloud server have been modified, we design an accumulative verification label based on symmetric cryptography. Furthermore, we prove the security of TR-DSSE-FC through simulation experiments. According to the performance experiment analysis, compared with analogous approaches, TR-DSSE-FC has significant merits in conjunctive query and verification. Liqing Chen, Yeting Wu, Jian Weng 0001, Zhiquan Liu 0001 |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2026 | Verifiable Multi-User Dynamic Searchable Symmetric Encryption With Forward and Backward Privacy Feasible for Cloud StorageabstractWith the evolution of cloud storage, data outsourcing has become a common trend. While cloud storage provides convenient services, its privacy and security issues have also attracted widespread attention. Dynamic searchable symmetric encryption (DSSE) provides an efficacious means of addressing data privacy issues by allowing data owners to directly perform retrieval or update operations on data while it is stored in the cloud. However, traditional DSSE cannot meet the needs of multi-user scenarios in practical applications. In addition, DSSE implements forward privacy and backward that is resistant to file-injection attack and support validation of search results. Therefore, we present verifiable multi-user dynamic searchable symmetric encryption with forward and backward privacy feasible for cloud storage (VM-DSSE-FB). The scheme constructs a DSSE framework that satisfies both forward and backward privacy by fusing symmetric encryption with homomorphic addition and bitmap indexing techniques. Meanwhile, we set up an encrypted update queue for each user to adapt to the requirements of multi-user scenarios. In addition, with the help of bitmap indexing and logicANDoperations, we realize the accurate multi-keyword query function. In particular, the cloud server returns the search results with a workload proof to realize the effective verification of the integrity and correctness of the search results. Security analysis proves that VM-DSSE-FB approach achieves adaptive security. The performance analysis shows that compared with existing similar schemes, VM-DSSE-FB achieves more functionality while improving efficiency and is more suitable for cloud storage services. Liqing Chen, Yeting Wu, Jian Weng 0001, Zhiquan Liu 0001 |
IEEE Trans. Inf. Forensics Secur. | 2 |