Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Le Gong

dblp:353/1639 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0002-0728-5585ORCID · reported

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

Security and privacy · 1 · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 since 2021Theory of computation · 1 · 1 first-author · 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.

Theoretical computer science
1 paper
Information theory · 70% Graph algorithms and graph theory · 30%
Network and information security
1 paper
Systems and software security · 100%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

Topics — the 5 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph signal processing
1.012026
Randomized Space-Time Sampling for Affine Graph Dynamical Systems · IEEE Trans. Inf. Theory 2026
Information theory › signal processing › compressed sensing
restricted isometry property
1.012026
Randomized Space-Time Sampling for Affine Graph Dynamical Systems · IEEE Trans. Inf. Theory 2026
Information theory › signal processing
sampling theory
1.012026
Randomized Space-Time Sampling for Affine Graph Dynamical Systems · IEEE Trans. Inf. Theory 2026
Information theory › signal processing › compressed sensing
stable recovery
1.012026
Randomized Space-Time Sampling for Affine Graph Dynamical Systems · IEEE Trans. Inf. Theory 2026
Graph algorithms and graph theory
spectral graph theory
0.312026
Randomized Space-Time Sampling for Affine Graph Dynamical Systems · IEEE Trans. Inf. Theory 2026

Methods — techniques the papers use, named apart from their topics

formal verification · 2.0spectral analysis · 1.0restricted isometry property · 1.0randomized sampling · 1.0
YearPublicationVenuePosition
2026 C-Verifier: Understanding and Formally Verifying Cross-Service Flaws in AWS Cognito
Ze Jin, Le Gong, Xiangyi Zeng, Qixu Liu
SP3
2026 Randomized Space-Time Sampling for Affine Graph Dynamical Systems
abstract
This paper investigates the problem of dynamical sampling for graph signals influenced by a constant source term. We consider signals evolving over time according to a linear dynamical system on a graph, where both the initial state and the source term are bandlimited. We introduce two random space-time sampling regimes and analyze the conditions under which stable recovery is achievable. While our framework extends recent work on homogeneous dynamics, it addresses a fundamentally different setting where the evolution includes a constant source term. This results in a non-orthogonal-diagonalizable system matrix, rendering classical spectral techniques inapplicable and introducing new challenges in sampling design, stability analysis, and joint recovery of both the initial state and the forcing term. A key component of our analysis is the spectral graph weighted coherence, which characterizes the interplay between the sampling distribution and the graph structure. We establish sampling complexity bounds ensuring stable recovery via the Restricted Isometry Property (RIP), and develop a robust recovery algorithm with provable error guarantees. The effectiveness of our method is validated through extensive experiments on both synthetic and real-world datasets.
Le Gong, Longxiu Huang
IEEE Trans. Inf. Theory1
2025 ExtFPDet: A CNN-Based Detection Framework for Browser Extensions Fingerprinting
abstract
With the widespread use of modern browser extensions, user experience has been significantly enhanced via embedding ancillary functionality into the original webpage. The rapid development of Web tracking technology has raised privacy and security concerns, as it generates a unique identifier for users according to the diversity of installed extensions and further prompts the profiling of users. However, due to the ignorance of potential privacy risks, there is no effective method to detect browser extension fingerprinting. In this paper, we propose ExtFPDet, a CNN-based detection framework to recognize browser extension fingerprinting in websites, which fills the gap in this area. Based on the preliminary investigation, the approaches to fingerprint browser extensions can be summarized into 2 categories according to the distinctive behaviors, including resource traversing and side-channel exploring. In order to extract effective features to reflect extensions fingerprinting, ExtFPDet focuses on the structure and content in the program dependency graph of Javascript files. The generated feature vector assists the CNN-based classification model to detect the extension fingerprinting, for which we perform a systematic detection on Tranco top 10K websites. Eventually, the result is evaluated by randomly sampling and manually checking, which shows superior detection capabilities of ExtFPDet.
Wei Liu 0243, Xiaoxi Wang, Yun Feng 0003, Xinyu Liu 0019, Le Gong, Kerui Huang, Yaqin Cao, Qixu Liu
CSCWD5