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

Zhizheng Lv

dblp:259/0023 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2022
—ORCID · none

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

Security and privacy · 2 · 2 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.

Network and information security
2 papers
Systems and software security · 70% Network security · 30%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Systems and software security › memory safety
memory corruption
0.612022
PACMem: Enforcing Spatial and Temporal Memory Safety via ARM Pointer Authentication · CCS 2022
Systems and software security
memory safety
0.612022
PACMem: Enforcing Spatial and Temporal Memory Safety via ARM Pointer Authentication · CCS 2022
Network security › attack resilience › attack mitigation › denial-of-service defense
DDoS defense
0.512021
Deterrence of Intelligent DDoS via Multi-Hop Traffic Divergence · CCS 2021
Processor architecture and microarchitecture › instruction set architecture › RISC
ARM architecture
0.212022
PACMem: Enforcing Spatial and Temporal Memory Safety via ARM Pointer Authentication · CCS 2022
Algorithmic game theory and mechanism design › security games
attack-defense game
0.112021
Deterrence of Intelligent DDoS via Multi-Hop Traffic Divergence · CCS 2021

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

pointer authentication · 1.1random-drop filtering · 1.0game-theoretic modeling · 1.0
YearPublicationVenuePosition
2022 PACMem: Enforcing Spatial and Temporal Memory Safety via ARM Pointer Authentication
abstract
Memory safety is a key security property that stops memory corruption vulnerabilities. Different types of memory safety enforcement solutions have been proposed and adopted by sanitizers or mitigations to catch and stop such bugs, at the development or deployment phase. However, existing solutions either provide partial memory safety or have overwhelmingly high performance overheads.
Yuan Li 0061, Wende Tan, Zhizheng Lv, Songtao Yang 0001, Mathias Payer, Ying Liu 0024, Chao Zhang 0008
CCS3
2021 Deterrence of Intelligent DDoS via Multi-Hop Traffic Divergence
abstract
We devise a simple, provably effective, and readily usable deterrence against intelligent, unknown DDoS threats: Demotivate adversaries to launch attacks via multi-hop traffic divergence. This new strategy is motivated by the fact that existing defenses almost always lag behind numerous emerging DDoS threats and evolving intelligent attack strategies. The root cause is if adversaries are smart and adaptive, no single-hop defenses (including optimal ones) can perfectly differentiate unknown DDoS and legitimate traffic. Instead, we formulate intelligent DDoS as a game between attackers and defenders, and prove how multi-hop traffic divergence helps bypass this dilemma by reversing the asymmetry between attackers and defenders. This insight results in EID, an Economical Intelligent DDoS Demotivation protocol. EID combines local weak (yet divergent) filters to provably null attack gains without knowing exploited vulnerabilities or attack strategies. It incentivizes multi-hop defenders to cooperate with boosted local service availability. EID is resilient to traffic dynamics and manipulations. It is readily deployable with random-drop filters in real networks today. Our experiments over a 49.8 TB dataset from a department at the Tsinghua campus network validate EID's viability against rational and irrational DDoS with negligible costs.
Yuanjie Li, Hewu Li, Zhizheng Lv, Xingkun Yao, Qianru Li 0002
CCS3