跳到正文
研踪PaperTrail

论文库

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

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

全站更新概况

+479新增论文
+361其中 AI 相关
+64已有论文修订
+95新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 21:56各信源进度 →

统计口径与数据新鲜度

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

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 21:56库内论文最新更新时间:2026-11-14 02:59

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

23,827 已收录论文19,941 AI 相关6,922 有修订112 HF 社区发现

浏览论文库

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

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v2arXiv:2610.29983

Free-XOR TFHE via Lazy Bootstrapping

Ali Ajorian, Osman Biçer

原文摘要

Gate bootstrapping (GB) is a widely used technique in FHEW-like fully homomorphic encryption schemes, such as TFHE,for evaluating Boolean gates while simultaneously reducing the noise of the resulting ciphertext. However, the computational cost of GB is typically dominated by an expensive blind rotation (BR). [8] proposed a gate bootstrapping framework in which XOR gates can be evaluated simply by adding the two input ciphertexts, resulting in what they call freeXOR. To obtain a functionally complete set of operations, they further designed a GB procedure for evaluating AND gates using two lightweight blind rotations. In this work, we propose a similar gate bootstrapping framework that supports free evaluation of XOR gates while evaluating all symmetric binary Boolean gates, i.e., the 8 gates whose output is identical for the inputs (0,1)and (1,0), using two blind rotations. In addition to providing broader gate support, our construction is substantially simpler than that of [8], both conceptually and in terms of implementation. As a proof of concept, we implemented our approach and compared it with standard TFHE, measuring speedups of about 30% for AES and 34% for SHA.

cs.CR