Xinyi Shi

dblp:156/3639 · DBLP profile ↗
← Back
11ranked-venue papers
2as first author
8since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 4 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 3 · 3 since 2021Security and privacy · 2 · 2 since 2021Computer networks · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 Updatable Private Set Intersection from Symmetric-Key Techniques
Junxin Liu, Peihan Miao 0001, Mike Rosulek, Xinyi Shi
EUROCRYPT (2)4
2025 Toward Forward-Secure End-to-End Data Sharing: An Attribute-Key-Free CP-ABE Scheme
abstract
In end-to-end data sharing, data are directly distributed to data receivers and stored on their terminals, making it hard to ensure forward security because receivers whose permissions have been revoked may still access previously shared data. To address these challenges, we propose an attribute-key-free CP-ABE scheme, aimed at securely binding data with access policies while ensuring forward security. Specifically, the decryption process in our scheme is delegated to the attribute authorities, which adopt the user’s real-time attribute values to decrypt the ciphertext. To prevent the honest-but-curious attribute authorities from accessing the plaintext, the ciphertext is re-encrypted with a one-time key before being sent to the attribute authorities. Furthermore, to prevent sensitive information from being inferred through the policy, we design a policy-hiding mechanism to conceal attribute values. Through these mechanisms, it can be ensured that the data subject always has control over his or her personal data during the end-to-end data-sharing process. We evaluate the performance of our scheme through both theoretical analysis and comparative experiments, and the results show our scheme’s effectiveness.
Xinyi Shi, Yunchuan Guo, Mingjie Yu, Daiyong Quan, Wenlong Kou, Fenghua Li 0001
ICASSP1
2025 Rule Generation for Anomalous Behaviors Detection in Enterprises: A Few-Shot Learning Approach via Chain-of-Thoughts
Xin Bao, Yunchuan Guo, Xinyi Shi, Kui Geng, Wenlong Kou, Zifu Li
ICIC (7)3
2025 GRE-Net: A forgery image detection framework based on gradient feature and reconstruction error
Xinyi Shi, Jinghai Ai
Comput. Vis. Image Underst.2
2025 Lightweight and Efficient Hybrid Network for UAV Identification Using Radio Frequency Fingerprinting
abstract
The widespread use of unmanned aerial vehicles brings both convenience and potential security risks, posing significant challenges for accurate UAV identification. To address the limitations of existing deep learning-based radio frequency fingerprinting methods in terms of computational complexity and model adaptability, this paper proposes an innovative hybrid model that combines Convolutional Neural Networks and Transformers to exploit both local and global features of RF signals fully. Our model consists of a Local Block and a Global Block. The Local Block employs Partial Convolution for feature extraction, PointWise Convolution to enhance feature representation, and the Squeeze-and-Excitation module to adaptively emphasize critical features, thereby improving local feature expressiveness. The Global Block comprises Unfold, Super Token Transformer Block, and Fold, which together enable effective modeling of global dependencies through signal unfolding, spatiotemporal transformations, and reconstruction. Experimental results show that under signal-to-noise ratio (SNR) conditions ranging from –5 dB to 20 dB, our method achieves an average recognition accuracy of 96.89%, with powerful performance under low SNR conditions. Furthermore, experiments demonstrate the model’s robustness with limited data. Even with only 1,000 training samples, the model maintains an accuracy of 92.14%. When incorporating Mixup data augmentation, high classification performance is sustained with just 500 training samples. These results highlight the method’s strong adaptability and practical potential in complex environments. Our codes and models are available at https://github.com/Zhoukaijie-hy/hybrid-model.
Kaijie Zhou, Qingbo Li, Peipei Cao, Zhenxin Cai, Xinyi Shi
IEEE Internet Things J.5
2024 Updatable Private Set Intersection Revisited: Extended Functionalities, Deletion, and Worst-Case Complexity
Saikrishna Badrinarayanan, Peihan Miao 0001, Xinyi Shi, Max Tromanhauser, Ruida Zeng
ASIACRYPT (6)3
2024 UCFilTransNet: Cross-Filtering Transformer-based network for CT image segmentation
Li Li 0099, Qiyuan Liu 0009, Xinyi Shi, Yujia Wei, Huanqi Li, Hanguang Xiao
Expert Syst. Appl.3
2024 DFMA-ICH: a deformable mixed-attention model for intracranial hemorrhage lesion segmentation based on deep supervision
Hanguang Xiao, Xinyi Shi, Qingling Xia, Diyou Chen, Li Li 0099, Qiyuan Liu 0009
Neural Comput. Appl.2
2016 InDel marker detection by integration of multiple softwares using machine learning techniques
abstract
BACKGROUND: In the biological experiments of soybean species, molecular markers are widely used to verify the soybean genome or construct its genetic map. Among a variety of molecular markers, insertions and deletions (InDels) are preferred with the advantages of wide distribution and high density at the whole-genome level. Hence, the problem of detecting InDels based on next-generation sequencing data is of great importance for the design of InDel markers. To tackle it, this paper integrated machine learning techniques with existing software and developed two algorithms for InDel detection, one is the best F-score method (BF-M) and the other is the Support Vector Machine (SVM) method (SVM-M), which is based on the classical SVM model. RESULTS: The experimental results show that the performance of BF-M was promising as indicated by the high precision and recall scores, whereas SVM-M yielded the best performance in terms of recall and F-score. Moreover, based on the InDel markers detected by SVM-M from soybeans that were collected from 56 different regions, highly polymorphic loci were selected to construct an InDel marker database for soybean. CONCLUSIONS: Compared to existing software tools, the two algorithms proposed in this work produced substantially higher precision and recall scores, and remained stable in various types of genomic regions. Moreover, based on SVM-M, we have constructed a database for soybean InDel markers and published it for academic research.
Jianqiu Yang, Xinyi Shi, Lun Hu, Daipeng Luo, Shengwu Xiong 0001, Fanjing Kong, Baohui Liu
BMC Bioinform.2
2015 QTLMiner: QTL database curation by mining tables in literature
abstract
MOTIVATION: Figures and tables in biomedical literature record vast amounts of important experiment results. In scientific papers, for example, quantitative trait locus (QTL) information is usually presented in tables. However, most of the popular text-mining methods focus on extracting knowledge from unstructured free text. As far as we know, there are no published works on mining tables in biomedical literature. In this article, we propose a method to extract QTL information from tables and plain text found in literature. Heterogeneous and complex tables were converted into a structured database, combined with information extracted from plain text. Our method could greatly reduce labor burdens involved with database curation. RESULTS: We applied our method on a soybean QTL database curation, from which 2278 records were extracted from 228 papers with a precision rate of 96.9% and a recall rate of 83.3%, F value for the method is 89.6%.
Xinyi Shi, Dongye Li, Baohui Liu, Fanjiang Kong
Bioinform.2
2015 PopGeV: a web-based large-scale population genome browser
abstract
MOTIVATION: The development of high-throughput sequencing technology has made it possible for more and more researchers to use population sequencing data to mine genes associated with specific traits. However, the massive amounts of sequencing data have also brought new challenges to the researchers. The question of how to browse population genomic data in an easy and intuitive manner must be addressed. Web-based genome browsers allow user to conveniently view the results of genomic analyses, but heavy usage can reduce the response speed of the webpage, which limits its usefulness in the display of large-scale genome data. IndexedDB technology is a good solution to this problem; it supports web browsers and so creates local databases. In this way, data can be read from the local storage, achieving a smooth display of population genomic data. RESULTS: PopGeV has the following characteristics. First, it uses a new encoding method for compression of population SNP and INDEL data. IndexedDB technology is used to download the results to local storage so that users can browse the results smoothly even when the network traffic is heavy. Second, PopGeV identify similar genomic regions between two individuals based on SNP data. Population diversity indexes are calculated when comparing two populations. Third, user defined annotation information can be integrated for user-friendly mining of gene functions. Simulation shows that PopGeV can smoothly display analysis results of population genome containing over 500 individuals with 2 millions SNP data. AVAILABILITY AND IMPLEMENTATION: PopGeV is available at www.soyomics.com/popgev/ CONTACT: [email protected].
Xinyi Shi, Xiaohan Yu 0001, Dongye Li, Baohui Liu, Fanjiang Kong
Bioinform.1