Files
papers/lux-validator-mpc/sections/99-conclusion.tex
zeekay 4a753bb639 papers: reorganize into per-paper dirs, add Antje Worring as co-author
Restructured from flat .tex/.pdf files into per-paper subdirectories.
Added Antje Worring as co-author on all papers.
Synced PDFs to pdfs/ for download site.
2026-04-18 21:50:07 -07:00

64 lines
2.5 KiB
TeX

\section{Conclusion}
Validators should not hold full signing keys. The single-key architecture is a
design flaw inherited from a time when blockchain validators were assumed to be
well-secured dedicated machines. Modern validator infrastructure---running on
cloud VMs, managed by organizations with varying security postures, targeted by
sophisticated adversaries---requires defense in depth.
Threshold cryptography provides this defense at acceptable cost: 2--19\,ms signing
latency, zero on-chain overhead (signatures are standard format), and a resharing
protocol that handles validator set changes without key reconstruction. The
implementation is deployed in production on the Lux network.
%% ========================================================================
%% BIBLIOGRAPHY
%% ========================================================================
\begin{thebibliography}{20}
\bibitem{canetti2021uc}
R. Canetti, R. Gennaro, S. Goldfeder, N. Makriyannis, and U. Peled, ``UC
Non-Interactive, Proactive, Threshold ECDSA with Identifiable Aborts,''
\emph{ACM CCS 2020}, pp.~1769--1787, 2020.
\bibitem{komlo2020frost}
C.~Komlo and I.~Goldberg, ``FROST: Flexible Round-Optimized Schnorr Threshold
Signatures,'' \emph{SAC 2020}, pp.~34--65, Springer, 2020.
\bibitem{pedersen1991threshold}
T.~P. Pedersen, ``A Threshold Cryptosystem without a Trusted Party,''
\emph{EUROCRYPT '91}, pp.~522--526, Springer, 1991.
\bibitem{feldman1987practical}
P.~Feldman, ``A Practical Scheme for Non-Interactive Verifiable Secret Sharing,''
\emph{FOCS '87}, pp.~427--437, IEEE, 1987.
\bibitem{gennaro2020fast}
R.~Gennaro and S.~Goldfeder, ``One Round Threshold ECDSA with Identifiable Abort,''
IACR ePrint 2020/540, 2020.
\bibitem{boldyreva2003threshold}
A.~Boldyreva, ``Threshold Signatures, Multisignatures and Blind Signatures Based on
the Gap-Diffie-Hellman-Group Signature Scheme,'' \emph{PKC 2003}, pp.~31--46,
Springer, 2003.
\bibitem{groth2021non}
J.~Groth, ``Non-Interactive Distributed Key Generation and Key Resharing,''
IACR ePrint 2021/339, 2021.
\bibitem{shamir1979share}
A.~Shamir, ``How to Share a Secret,'' \emph{Communications of the ACM}, vol.~22,
no.~11, pp.~612--613, 1979.
\bibitem{desmedt1989threshold}
Y.~Desmedt, ``Threshold Cryptosystems,'' \emph{AUSCRYPT '89}, pp.~3--14,
Springer, 1990.
\bibitem{boneh2001bls}
D. Boneh, B. Lynn, and H. Shacham, ``Short Signatures from the Weil Pairing,''
\emph{Journal of Cryptology}, vol.~17, no.~4, pp.~297--319, 2004.
\end{thebibliography}