Jiamin Cui

dblp:281/8415 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
3since 2021 · last 2025
0009-0004-4117-0652ORCID · corroborated

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

Security and privacy · 2 · 2 first-author · 2 since 2021Computer networks · 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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 87% Distributed systems · 13%
Computer networks
1 paper
Internet architecture and protocols · 50% Routing and switching · 50%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

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

TopicWeightPapersLastEvidence papers
Internet architecture and protocols
packet scheduling
0.912025
Time-Triggered Flow Scheduling for Synchronization-Deviation-Tolerant TSN · ICNP 2025
Routing and switching › scheduling algorithms
time-triggered scheduling
0.912025
Time-Triggered Flow Scheduling for Synchronization-Deviation-Tolerant TSN · ICNP 2025
Embedded and real-time systems › real-time communication
real-time networks
0.912025
Time-Triggered Flow Scheduling for Synchronization-Deviation-Tolerant TSN · ICNP 2025
Embedded and real-time systems › real-time communication › real-time networks
time-sensitive networking
0.912025
Time-Triggered Flow Scheduling for Synchronization-Deviation-Tolerant TSN · ICNP 2025
Cryptographic primitives and cryptanalysis › block cipher cryptanalysis › integral cryptanalysis
division property
0.612022
On the Field-Based Division Property: Applications to MiMC, Feistel MiMC and GMiMC · ASIACRYPT (3) 2022
Distributed systems
clock synchronization
0.312025
Time-Triggered Flow Scheduling for Synchronization-Deviation-Tolerant TSN · ICNP 2025

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

satisfiability modulo theories · 1.7heuristic algorithm · 1.7
YearPublicationVenuePosition
2025 Time-Triggered Flow Scheduling for Synchronization-Deviation-Tolerant TSN
abstract
Time-sensitive networking (TSN) has been widely used in industrial automation and automotive applications by precisely opening and closing the gates of packet queues. However, both clock drift and network congestion will likely result in timing misalignment when the clock synchronization protocol gPTP (802.1 AS) is used. This timing misalignment may, in turn, cause failure in forwarding packets at scheduled times and hence unexpected delay jitters, or even miss application deadlines. To address this acute problem, we propose a novel TSN scheduling algorithm, called SDT-TSN (Synchronization-Deviation-Tolerant TSN), to ensure that packets can still arrive on time and be transmitted deterministically even in the presence of inexact time synchronization. First, we formalize the linear constraint model of flow scheduling to maximize the tolerance of inexact time synchronization. Then, we propose an optimal algorithm based on SMT (Satisfiability Modulo Theories) and a fast heuristic algorithm to solve the packet scheduling problem under inexact network synchronization. SDT-TSN is the first to derive the maximum tolerable time-synchronization deviation. Finally, we evaluate SDT-TSN, demonstrating its capability of eliminating packet-forwarding failures due to the commonly-used/assumed constant time-synchronization deviation and increasing the tolerable synchronization deviation from 140µs to 480µs.
Jiamin Cui, Zonghui Li, Kang G. Shin
ICNP1
2022 On the Field-Based Division Property: Applications to MiMC, Feistel MiMC and GMiMC
Jiamin Cui, Kai Hu 0001, Meiqin Wang 0001, Puwen Wei
ASIACRYPT (3)1
2022 Integral Attacks on Pyjamask-96 and Round-Reduced Pyjamask-128
Jiamin Cui, Kai Hu 0001, Qingju Wang 0001, Meiqin Wang 0001
CT-RSA1