EDBT 2026 Demo / reviewers in the wild / expert
Xixun Yu
dblp:183/5235
· DBLP profile ↗
8ranked-venue papers
5as first author
5since 2021 · last 2026
0000-0003-3461-8856ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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 · 75% Privacy and data protection · 25% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
private information retrieval |
0.7 | 1 | 2023 | VeriDedup: A Verifiable Cloud Data Deduplication Scheme With Integrity and Duplication Proof · IEEE Trans. Dependable Secur. Comput. 2023 |
Cryptographic protocols and secure computation
private set intersection |
0.7 | 1 | 2023 | VeriDedup: A Verifiable Cloud Data Deduplication Scheme With Integrity and Duplication Proof · IEEE Trans. Dependable Secur. Comput. 2023 |
Cryptographic protocols and secure computation › verifiable storage › proof of storage
proof of retrievability |
0.7 | 1 | 2023 | VeriDedup: A Verifiable Cloud Data Deduplication Scheme With Integrity and Duplication Proof · IEEE Trans. Dependable Secur. Comput. 2023 |
Methods — techniques the papers use, named apart from their topics
verification tag · 0.7message-locked encryption · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | LVProv: A Lightweight Blockchain-Anchored Verifiable Provenance Scheme for High-Dimensional Data
Xixun Yu, Huazhong Liu, Laurence T. Yang |
IWQoS | 1 |
| 2023 | VeriORouting: Verification on intelligent routing outsourced to the cloud
Xixun Yu, Zheng Yan 0002, Laurence T. Yang |
Inf. Sci. | 2 |
| 2023 | SecDedup: Secure data deduplication with dynamic auditing in the cloud
Zheng Yan 0002, Xueqin Liang, Xixun Yu |
Inf. Sci. | 4 |
| 2023 | VeriDedup: A Verifiable Cloud Data Deduplication Scheme With Integrity and Duplication ProofabstractData deduplication is a technique to eliminate duplicate data in order to save storage space and enlarge upload bandwidth, which has been applied by cloud storage systems. However, a cloud storage provider (CSP) may tamper user data or cheat users to pay unused storage for duplicate data that are only stored once. Although previous solutions adopt message-locked encryption along with Proof of Retrievability (PoR) to check the integrity of deduplicated encrypted data, they ignore proving the correctness of duplication check during data upload and require the same file to be derived into same verification tags, which suffers from brute-force attacks and restricts users from flexibly creating their own individual verification tags. In this paper, we propose a verifiable deduplication scheme called VeriDedup to address the above problems. It can guarantee the correctness of duplication check and support flexible tag generation for integrity check over encrypted data deduplication in an integrative way. Concretely, we propose a novel Tag-flexible Deduplication-supported Integrity Check Protocol (TDICP) based on Private Information Retrieval (PIR) by introducing a novel verification tag called${note\ set}$, which allows multiple users holding the same file to generate their individual verification tags and still supports tag deduplication at the CSP. Furthermore, we make the first attempt to guarantee the correctness of data duplication check by introducing a novel User Determined Duplication Check Protocol (UDDCP) based on Private Set Intersection (PSI), which can resist a CSP from providing a fake duplication check result to users. Security analysis shows the correctness and soundness of our scheme. Simulation studies based on real data show the efficacy and efficiency of our proposed scheme and its significant advantages over prior arts. Xixun Yu, Zheng Yan 0002, Rui Zhang 0007 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2021 | Secure Outsourced Top-k Selection Queries against Untrusted Cloud Service ProvidersabstractAs cloud computing reshapes the global IT industry, an increasing number of business owners have outsourced their datasets to third-party cloud service providers (CSP), which in turn answer data queries from end users on their behalf. A well known security challenge in data outsourcing is that the CSP cannot be fully trusted, which may return inauthentic or unsound query results for various reasons. This paper considers top-k selection queries, an important type of queries widely used in practice. In a top-k selection query, a user specifies a scoring function and asks for the k objects with the highest scores. Despite several recent efforts, existing solutions can only support a limited range of scoring functions with explicit forms known in advance. This paper presents three novel schemes that allow a user to verify the integrity and soundness of any top-k selection query result returned by an untrusted CSP. The first two schemes support monotone scoring functions, and the third scheme supports scoring functions comprised of both monotonically non-decreasing and non-increasing subscoring functions. Detailed simulation studies using a real dataset confirm the efficacy and efficiency of the proposed schemes and their significant advantages over prior solutions. Xixun Yu, Rui Zhang 0007, Zheng Yan 0002 |
IWQoS | 1 |
| 2019 | Verifiable outsourced computation over encrypted data
Xixun Yu, Zheng Yan 0002, Rui Zhang 0007 |
Inf. Sci. | 1 |
| 2017 | A Survey of Verifiable Computation
Xixun Yu, Zheng Yan 0002, Athanasios V. Vasilakos |
Mob. Networks Appl. | 1 |
| 2016 | Deduplication on Encrypted Big Data in CloudabstractCloud computing offers a new way of service provision by re-arranging various resources over the Internet. The most important and popular cloud service is data storage. In order to preserve the privacy of data holders, data are often stored in cloud in an encrypted form. However, encrypted data introduce new challenges for cloud data deduplication, which becomes crucial for big data storage and processing in cloud. Traditional deduplication schemes cannot work on encrypted data. Existing solutions of encrypted data deduplication suffer from security weakness. They cannot flexibly support data access control and revocation. Therefore, few of them can be readily deployed in practice. In this paper, we propose a scheme to deduplicate encrypted data stored in cloud based on ownership challenge and proxy re-encryption. It integrates cloud data deduplication with access control. We evaluate its performance based on extensive analysis and computer simulations. The results show the superior efficiency and effectiveness of the scheme for potential practical deployment, especially for big data deduplication in cloud storage. Zheng Yan 0002, Wenxiu Ding, Xixun Yu, Haiqi Zhu, Robert H. Deng |
IEEE Trans. Big Data | 3 |