mirror of
https://github.com/lux-apps/papers.git
synced 2026-10-30 18:15:21 +00:00
zeekay
b8b1ec619b
Continuation of the 87a0cee sweep — covers the two remaining FHE
papers that still cited Zama and/or Fhenix as comparators.
threshold-fhe-compliance/09-related-work.tex + 99-conclusion.tex:
drops the "Fhenix and Zama implement FHE on EVM chains but use a
single decryption key" comparison; rewrites positively around the
Lux M-of-N Shamir-over-Zq threshold decryption in
lux/fhe/pkg/threshold/. Bibliography drops fhenix2024 + zama2024;
adds lux-fhe-smart-contracts + lux-fhe-runtime cross-cites.
lux-fhe-smart-contracts/09-related-work.tex + 99-conclusion.tex:
full rewrite of the related-work section — drops the Zama fhEVM /
Inco Network / TFHE-rs comparison paragraphs in favor of a "FHE on
the EVM" + "Threshold decryption" + "FHE compilers" structure that
names only the Lux components (lux/precompile/fhe, lux/fhe,
luxcpp/gpu, lux-private/gpu-kernels, planned Refractor compiler).
Bibliography: drops zama2023fhevm + inco2024; replaces with
lux-fhe-go + lux-precompile-fhe.
Lux FHEVM (capital F) remains as the canonical Lux product name —
distinct from Zama's lowercase fhEVM brand. \label{sec:fhevm} and
existing bibkey lux-fhevm are LaTeX/citation infrastructure and are
unaffected.
Pairs with the parallel liquidity/papers + zoo/papers sweeps.
26 lines
1.1 KiB
TeX
26 lines
1.1 KiB
TeX
\section{Related Work}
|
|
|
|
\label{sec:related}
|
|
%% =====================================================================
|
|
|
|
Threshold FHE was introduced by Asharov et al.~\cite{asharov2012}
|
|
in the BGV setting. Boneh et al.~\cite{boneh2018} extended threshold
|
|
decryption to the CKKS scheme for approximate arithmetic. Our
|
|
construction is the first to combine TFHE (boolean circuits) with
|
|
threshold decryption for regulatory compliance in a blockchain
|
|
setting.
|
|
|
|
The FHE-MPC hybrid model is explored in Mouchet et
|
|
al.~\cite{mouchet2021} (Lattigo library), who demonstrate multiparty
|
|
CKKS computation. We differ in two respects: we use TFHE (exact
|
|
boolean circuits, not approximate arithmetic) and we explicitly model
|
|
the regulatory forced-decryption requirement.
|
|
|
|
Prior FHE-on-EVM systems use a single decryption key held by a trusted
|
|
party or a TEE; our threshold approach eliminates this single point of
|
|
trust by distributing the FHE secret key across the Lux validator set
|
|
with M-of-N Shamir-over-$\mathbb{Z}_q$ partial decryption (see
|
|
\texttt{lux/fhe/pkg/threshold/}).
|
|
|
|
%% =====================================================================
|