Abstract:Fully homomorphic encryption (FHE) enables privacy-preserving cloud computation, but its efficiency is often limited by the cost of bootstrapping. In particular, existing functional bootstrapping techniques have complexity exponential in the plaintext size. In this work, we show that employing a single quantum server can reduce this dependence.
We propose a quantum functional bootstrapping algorithm that allows to evaluate any efficiently computable function in time polynomial in the plaintext size. For general functional bootstrapping over $l$-bit plaintexts, we obtain a time--space tradeoff: poly($l$)-time evaluation can be achieved with O$(2^l)$ qubits, while reducing the space complexity increases the time complexity.
Technically, we extend a key classical cryptographic operation, known as \emph{blind rotation}, to the quantum setting by replacing polynomial-exponent encoding with quantum phase encoding. Underlying our extension are insights for the quantum extension of polynomial-based cryptographic tools that may gain dramatic speedups.
From: Guangsheng Ma [view email]
[v1]
Mon, 30 Sep 2024 10:49:18 UTC (3,902 KB)
[v2]
Mon, 28 Oct 2024 07:58:09 UTC (3,898 KB)
[v3]
Tue, 29 Oct 2024 15:09:15 UTC (968 KB)
[v4]
Wed, 2 Sep 2026 01:46:07 UTC (951 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。