Newest papers

Free-XOR TFHE via Lazy Bootstrapping

Ali Ajorian, Osman Biçer · 2026 · arXiv

DOI: 10.48550/arXiv.2610.29983 · open-access PDF

Indonesian

Gate bootstrapping (GB) adalah teknik yang banyak digunakan dalam skema enkripsi FHEW-like yang sepenuhnya homomorfik, seperti TFHE, untuk mengevaluasi gerbang Boolean sambil secara bersamaan mengurangi kebisingan dari teks enkripsi yang dihasilkan. Namun, biaya komputasi GB biasanya didominasi oleh rotasi buta yang mahal (BR). \citechen{2024free} mengusulkan kerangka bootstrapping gerbang di mana $\txor$ gerbang dapat dievaluasi hanya dengan menambahkan dua teks enkripsi input, menghasilkan apa yang mereka sebut \textit{free-XOR}.

Machine translation (Meta M2M100); the English original follows.

Abstract

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). \cite{chen2024free} proposed a gate bootstrapping framework in which $\txor$ gates can be evaluated simply by adding the two input ciphertexts, resulting in what they call \textit{free-XOR}. To obtain a functionally complete set of operations, they further designed a GB procedure for eva

Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese

Is this paper real? This page was built from OpenAlex and arXiv records, not generated. Software can verify any reference in one call: GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.29983, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txt

Sources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange