LWE-Based Threshold Key Management with Dynamic Enrollment and Share Refresh

We present a trusted-dealer Learning with Errors (LWE)-based threshold key-management framework that separates the public-key layer from threshold-share maintenance. The coordinator generates one LWE public key PK=(A,b),b=As+e(modq) and distributes the same secret vector through coordinate-wise Shamir (t,n) sharing. Dynamic membership is restricted to enrollment: a new participant obtains an evaluation of the existing sharing polynomial, so enrollment does not rotate the secret or change the LWE key pair. Share refresh uses participant-generated degree-(t−1) vector polynomials with zero constant term. Their evaluations are exchanged over authenticated private channels and added locally, preserving the same secret without interpolation or accumulation of LWE error. This paper formalizes exact threshold recovery, single-epoch share privacy, and cross-epoch share-snapshot privacy under a restricted post-refresh observation model with hidden refresh state and effective erasure. It also introduces an explicit epoch-consistency rule so that recovery never mixes shares from different refresh epochs and derives communication and computation costs separately for setup, enrollment, refresh, and recovery. Hash-based commitments and authenticated private channels are treated as integrity and delivery mechanisms rather than as substitutes for maliciously secure verifiable secret sharing (VSS). The post-quantum claim is conditional on concrete validation of the selected LWE parameter tuple. Dealerless distributed key generation (DKG), coordinator-compromise proactive security, participant departure, threshold changes, and a complete quantum random oracle model (QROM) reduction remain outside the present security claims.

Authors

Institutions

Publication Details

Journal
Electronics
Published
2026-10-15
DOI
https://doi.org/10.3390/electronics15204755
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

LWE-Based Threshold Key Management with Dynamic Enrollment and Share Refresh

Zhao Dou, Long Qian, Bichen Che
Electronics
Cryptography and Data Security
article

LWE-Based Threshold Key Management with Dynamic Enrollment and Share Refresh

Zhao Dou, Long Qian, Bichen Che
article en

Abstract

We present a trusted-dealer Learning with Errors (LWE)-based threshold key-management framework that separates the public-key layer from threshold-share maintenance. The coordinator generates one LWE public key PK=(A,b),b=As+e(modq) and distributes the same secret vector through coordinate-wise Shamir (t,n) sharing. Dynamic membership is restricted to enrollment: a new participant obtains an evaluation of the existing sharing polynomial, so enrollment does not rotate the secret or change the LWE key pair. Share refresh uses participant-generated degree-(t−1) vector polynomials with zero constant term. Their evaluations are exchanged over authenticated private channels and added locally, preserving the same secret without interpolation or accumulation of LWE error. This paper formalizes exact threshold recovery, single-epoch share privacy, and cross-epoch share-snapshot privacy under a restricted post-refresh observation model with hidden refresh state and effective erasure. It also introduces an explicit epoch-consistency rule so that recovery never mixes shares from different refresh epochs and derives communication and computation costs separately for setup, enrollment, refresh, and recovery. Hash-based commitments and authenticated private channels are treated as integrity and delivery mechanisms rather than as substitutes for maliciously secure verifiable secret sharing (VSS). The post-quantum claim is conditional on concrete validation of the selected LWE parameter tuple. Dealerless distributed key generation (DKG), coordinator-compromise proactive security, participant departure, threshold changes, and a complete quantum random oracle model (QROM) reduction remain outside the present security claims.

ElectronicsVol. 15(20)
Beijing University of Posts and Telecommunications (CN), State Key Laboratory of Networking and Switching Technology, University of International Relations (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 13%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.