Paper extends free-XOR TFHE bootstrapping to symmetric Boolean gates
Original title: Free-XOR TFHE via Lazy Bootstrapping
The construction evaluates XOR by adding ciphertexts and all eight symmetric binary gates with two blind rotations.
A cs.CR paper proposes a TFHE-style gate-bootstrapping framework that evaluates XOR by adding the two input ciphertexts, called free-XOR. It evaluates all eight symmetric binary Boolean gates, whose outputs match on inputs (0,1) and (1,0), using two blind rotations. The authors say the design is conceptually and implementationally simpler than the Chen et al. 2024 free-XOR framework, which used two lightweight blind rotations for AND.
- Gate bootstrapping cost is described as dominated by blind rotation.
- XOR needs no blind rotation under the free-XOR approach.
- Eight symmetric binary gates are covered, not only AND.
- The authors contrast the method with Chen et al. 2024.
From the original article
1 min read at arxiv.orgGate 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).
By Ali Ajorian · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.