Zishen Zhao

dblp:294/2893 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
5since 2021 · last 2026
0000-0002-2875-4264ORCID · corroborated

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

Databases, data management, data science and information retrieval · 2 · 2 first-author · 2 since 2021Theory of computation · 2 · 2 first-author · 2 since 2021Security and privacy · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Rail image harmonization dataset: a seed to generate evaluation resources for track vision inspection systems
Zishen Zhao, Zhi Han, Chunlei Chen, Jinfei Hao, Shengzhe Tao
Multim. Syst.2
2025 Code Doppler Channel Simulation Methods and Performance Evaluation for Satellite Communication Scenarios
abstract
In satellite communication systems, the Doppler effect caused by the high-speed motion of satellites significantly impacts the stability and performance of communication links. This is especially evident in pseudo-random code modulation systems, where the Doppler effect induces a frequency offset in the pseudo-code rate, thereby degrading signal demodulation performance. Focusing on the code Doppler effect in satellite communication scenarios, this paper investigates a channel simulation method adapted to the code Doppler effect and verifies its effectiveness.
Hao Zhou 0012, Yiyan Ma, Dan Fei, Bowen Yin, Zishen Zhao, Bo Ai 0001
VTC2025-Fall6
2023 Revisiting lower dimension lattice attacks on NTRU
Zishen Zhao
Inf. Process. Lett.1
2022 On the Measurement and Simulation of the BKZ Behavior for q-ary Lattices
Zishen Zhao, Guangwu Xu
Inscrypt1
2021 Improved cube-attack-like cryptanalysis of reduced-round Ketje-Jr and Keccak-MAC
abstract
At EUROCRYPT 2015, Dinur et al. proposed cube-attack-like cryptanalysis on reduced-round Keccak. The process of recovering the key is divided into the preprocessing and the online phase. The preprocessing phase is setting a look-up table by computing the cube sum of involved key bits. The online phase is computing the cube sum of auxiliary variables and recording the matching values in the table as candidates. Auxiliary variables help balance the complexity of the two phases by reducing the number of involved key bits. Following this idea, a series of works has been presented, mainly focusing on a better selection of cube variables, auxiliary variables and involved key bits. We provide new methods to select auxiliary variables and involved key bits. The first step is to get a precise algebraic expression of each bit after one round permutation. Then, combined with the corresponding constraints on these variables, we can construct a Mixed-integer Linear Programming (MILP) model. Secondly, unlike the previous idea that auxiliary variables are chosen to satisfy the CP-kernel property just for the consideration of controlling diffusion, we cancel this restriction and adopt a more skilled selection of auxiliary variables. Based on these two steps, we improve the cube-attack-like cryptanalysis in terms of the complexity.
Zishen Zhao, Meiqin Wang 0001, Wei Wang 0035
Inf. Process. Lett.1