Revisiting Shamir Secret Sharing for Threshold Fully Homomorphic Encryption

Recent advances in lattice-based threshold cryptography, including threshold fully homomorphic encryption (ThFHE) and threshold public key encryption (ThPKE), commonly employ Shamir secret sharing over rings. While conceptually simple, these schemes suffer from rapidly growing denominator-clearing factors required for secret reconstruction as the number of parties 𝑁 increases, which in turn necessitates larger ciphertext moduli and complex reconstruction procedures. In this work, we revisit the notion of subtractive sets underlying ring-based Shamir secret sharing and present a refined framework for constructing integer-reconstructible sharing over cyclotomic rings. To that end, we introduce a new geometric analysis of Lagrange coefficients and show that the resulting reconstruction factors can be made significantly smaller under specific settings. In particular, our framework enables smaller ciphertext sizes in (𝑡, 𝑁 )threshold settings, and yields improved correctness and efficiency when applied to any ring-based threshold construction employing Shamir secret sharing over cyclotomic rings. Specifically, in latticebased one-round (𝑡, 𝑁 )-ThFHE schemes, our approach reduces the bit-size of ciphertext moduli from 𝑂 (𝑁 ) to 𝑂 (𝑡 log(𝑁 /𝑡 2 )) while ensuring efficient denominator handling. For lattice-based ThPKE, our method yields a new bound on reconstruction factors that improves upon the recent state-of-the-art result of Pilvi. Moreover, we implement ThFHE schemes over cyclotomic rings based on our framework and demonstrate their practical efficiency. Our experimental results show that each algorithm completes within 0.2 seconds for 𝑁 = 64 and remains scalable for larger configurations with 𝑁 ≥ 256. CCS Concepts • Security and privacy → Cryptography.