用同态加密实现SIFT算法，揭示当前技术瓶颈并提供优化方案
A Practical Exercise in Adapting SIFT Using FHE Primitives
- 将常规代码改写适配同态加密环境，提升可操作性
- 改进数组最大值、直方图分箱等操作，降低计算深度
- 引入延迟计算策略，避免加密域内昂贵的比较运算
使用CKKS全同态加密快速实现尺度不变特征变换（SIFT）暴露了当前同态加密范式中的若干明显局限：缺乏标准比较操作及其依赖项（如数组最大值、直方图分箱等）。现有方案或过于底层，或缺乏合适抽象以支持类似SIFT的算法实现。本文展示：1. 将常规代码适配至同态加密环境的方法；2. 改进标准算法（如数组最大值、直方图分箱等）以降低乘法深度；3. 一种新颖的延迟计算方法，避免在加密域执行昂贵的比较操作。本工作旨在为算法适配同态加密提供实用指导。
原文摘要 · Abstract (English)
An exercise in implementing Scale Invariant Feature Transform using CKKS Fully Homomorphic encryption quickly reveals some glaring limitations in the current FHE paradigm. These limitations include the lack of a standard comparison operator and certain operations that depend on it (like array max, histogram binning etc). We also observe that the existing solutions are either too low level or do not have proper abstractions to implement algorithms like SIFT. In this work, we demonstrate: 1. Methods of adapting regular code to the FHE setting. 2. Alternate implementations of standard algorithms (like array max, histogram binning, etc.) to reduce the multiplicative depth. 3. A novel method of using deferred computations to avoid performing expensive operations such as comparisons in the encrypted domain. Through this exercise, we hope this work acts as a practical guide on how one can adapt algorithms to FHE
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。