跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+197新增论文
+151其中 AI 相关
+16已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-21 12:19 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-21 12:19最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

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

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

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

找到 3 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-21 12:17(北京时间)
版本更新 · v4arXiv:2307.14679

Braid: Sybil-Resistant Decentralized Identity with Trustless Key Recovery and Non-Transferable Anonymous Credentials

Rui Song, Tianyu Zheng, Shang Gao, Guyue Li, Xue Liu, Bin Xiao

原文摘要

Decentralized identity frameworks grant users full sovereignty over their digital assets in the Web3 ecosystem. However, allowing arbitrary creation of identifiers makes the system susceptible to Sybil attacks and puts assets at risk when keys are lost or compromised. Moreover, the lack of identification prevents anonymous credential schemes from deterring malicious transfers. Existing solutions link identifiers to entities through trusted intermediaries, which are not always accessible and require costly offline interactions. We introduce Braid, a decentralized identity system with Sybil resistance, trustless key recovery, and non-transferable anonymous credentials. Braid creates blockchain-based bindings between identifiers and gradually combines identifiers belonging to the same holder into a unified associated identifier. As all identifiers within an association are presumed to belong to one individual, any fraudulent activity can be detected. The association grows larger as interactions increase, substantially reducing the likelihood of successful Sybil attacks. This mechanism allows holders to recover identifiers with lost keys or partial key compromise by proving knowledge of specific association structures. Additionally, Braid prevents unauthorized transfers through blockchain-based identifier-key bindings and proofs of ownership for credentials. Compared with representative prior approaches that provide only campaign-scoped Sybil protection or stateless anonymous-credential presentation, Braid carries association state across applications, enabling progressive Sybil resistance and trustless recovery while preserving zero-knowledge credential presentation. The evaluation shows that Braid bridges privacy-preserving credentials and accountable identity, achieving identifier association and credential presentation times of 2.41s and 3.31s on consumer-grade devices.

cs.CR

新论文 · v1arXiv:2611.02761

Movable Antenna-Assisted Secret Key Generation over Temporally Correlated Channels

Zhiyu Huang, Chen Sun, Guyue Li, Guanghui Wen, Xianbin Wang

原文摘要

Physical-layer key generation (PLKG) exploits reciprocal channel dynamics to generate symmetric keys, addressing the key distribution problem in wireless communications. However, strong temporal correlation in slow-fading environments limits fresh randomness and results in low key generation rates. Movable antennas (MAs) introduce spatial degrees of freedom through antenna repositioning, providing a new approach to addressing the limitation. This paper investigates MA-assisted PLKG over temporally correlated channels. A first-order Gauss-Markov process is utilized to characterize the temporal correlation of multipath gains. We characterize the full-sequence mutual information (MI) over temporally correlated channels. For fixed antenna positions and beamforming, we establish a finite-horizon approximation error bound that vanishes as both effective signal-to-noise ratios (SNRs) increase. We derive a closed-form expression for the one-step conditional MI and adopt it as a tractable key-information metric. A nonconvex problem is formulated to jointly optimize antenna positions and per-slot beamforming under transmit-power and minimum-spacing constraints. We develop an alternating optimization algorithm, combining an exact principal-eigenvector beamforming solution with feasible SCA-based projected gradient position updates. Simulation results demonstrate that the MA-assisted scheme outperforms the fixed-position antenna baseline. At a high temporal correlation coefficient, position optimization achieves approximately $51\%$ higher rates than fixed antennas. Joint position and beamforming optimization provides a further $106\%$ gain over position optimization alone, demonstrating more pronounced gains under strong temporal correlation.

cs.IT · cs.CR · eess.SP

新论文 · v1arXiv:2610.38265

TreemapMix: Dirichlet-Controlled Multi-Image Augmentation for Probability and Ordinal Supervision

Ejafa Bassam, Konstantin Garbers, Yingsheng Geng, Dalton Jens, Jiaxu Qian, Guyue Liu

原文摘要

Data augmentation improves visual recognition by exposing models to synthetic training examples that encourage generalization beyond the observed data. Mixed-sample methods extend this idea by combining multiple images. However, many common approaches either mix only pairs of images or rely on fixed small layouts, limiting control over source count, visible area proportions, and induced supervision. We propose TreemapMix, a distribution-controlled multi-image augmentation that samples source weights from a Dirichlet distribution and assigns them to area-proportional regions using a treemap partition. The resulting known region areas support two complementary objectives. TreemapMix with soft cross-entropy (SCE) treats areas as soft class-probability targets, while TreemapMix with a Plackett-Luce (PL) objective converts areas into ordinal supervision. On ImageNet-1K under matched training recipes, TreemapMix-SCE achieves substantially lower calibration error than evaluated mixed-sample baselines, while TreemapMix-PL achieves the strongest Top-1 accuracy. Transfer experiments on object detection and instance segmentation suggest that TreemapMix-pretrained features remain useful beyond classification. These results show that controlled multi-image composition can expose the same region-area information as either probability-matching or rank-matching supervision. Code is available at https://github.com/Ejafa/treemapmix.

cs.CV