跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+2已有论文修订
+100新增 AI 导读

arXiv 最近完成扫描:2026-11-15 00:32 · 全站最近入库:2026-11-14 15:09各信源进度 →

统计口径与数据新鲜度

统计 2026-11-14 01:08 — 2026-11-15 01:08(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-15 00:32最近发现新增版本:2026-11-14 15:09库内论文最新更新时间:2026-11-13 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,348 已收录论文19,580 AI 相关6,729 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-15 00:30(北京时间)
版本更新 · v2arXiv:2611.09422

Robust & Scalable Website Fingerprinting via Minimal DRAM Traffic

Shubham Roy, Samar Perwez, Biswabandan Panda

原文摘要

Website fingerprinting attacks infer websites visited by users and threaten their privacy. These attacks are classified as on-path, which monitor network traffic, and co-located, which exploit shared system resources. Existing co-located attacks, such as sweep-counting and loop-counting, achieve over 90% accuracy but suffer significant performance degradation on many-core systems. Loop-counting accuracy drops from 93% on 8 cores to 50% on 24 cores, while sweep-counting accuracy decreases from 84% to 45% across multiple Core Complex Dies (CCDs). To address these limitations, we propose memory-chasing, a scalable website fingerprinting attack that exploits DRAM traffic interference through pointer-chasing traversals with minimal interference. By counting DRAM accesses over fixed intervals, the attack generates distinctive traces for website classification. Evaluated on the top 50 websites, memory-chasing achieves 96% accuracy on a 24-core system, 86% across multiple CCDs, 80% across multiple sockets, and 97% in an open-world setting. Extensive evaluation across hardware configurations, browsers, operating systems, isolation mechanisms, system noise, and countermeasures demonstrates its robustness and scalability.

cs.CR · cs.AR