This paper presents the first construction of simulation-secure lattice-based threshold PKE with polynomially bounded modulus. The construction is based on the LWE problem and uses an improved analysis to show that simulation is possible even with small flooding noise. The modulus is small both asymptotically and concretely, with parameters comparable to those of highly optimized non-threshold schemes like FrodoKEM. The paper also shows that LWE remains hard in the presence of certain types of leakage, which may be useful in other contexts where noise flooding is used. The paper introduces a threshold version of lattice-based encryption, which allows for collaborative decryption. The main drawback of existing schemes is the use of superpolynomially large noise for noise flooding, which impacts both efficiency and security. The proposed construction uses polynomial modulus and Gaussian noise, allowing for efficient and secure threshold decryption. The paper provides a general construction and analysis technique applicable to a broad range of lattice-based encryption schemes. It shows that the scheme is simulation-secure, supports an arbitrary number of decryption queries, and uses a polynomial modulus. The paper also discusses related work, including previous threshold PKE schemes and their security properties. The paper presents a detailed analysis of the security of the proposed scheme, including the use of Gaussian noise and the hardness of LWE in the presence of leakage. It also discusses the use of Ring LWE and the implications of known-covariance RLWE for the security of the scheme. The paper concludes with a discussion of the practicality of the proposed scheme, including the use of concrete parameters and the potential for further research in the area of threshold PKE. The paper also highlights the importance of simulation security in threshold cryptography and the need for further research in this area.This paper presents the first construction of simulation-secure lattice-based threshold PKE with polynomially bounded modulus. The construction is based on the LWE problem and uses an improved analysis to show that simulation is possible even with small flooding noise. The modulus is small both asymptotically and concretely, with parameters comparable to those of highly optimized non-threshold schemes like FrodoKEM. The paper also shows that LWE remains hard in the presence of certain types of leakage, which may be useful in other contexts where noise flooding is used. The paper introduces a threshold version of lattice-based encryption, which allows for collaborative decryption. The main drawback of existing schemes is the use of superpolynomially large noise for noise flooding, which impacts both efficiency and security. The proposed construction uses polynomial modulus and Gaussian noise, allowing for efficient and secure threshold decryption. The paper provides a general construction and analysis technique applicable to a broad range of lattice-based encryption schemes. It shows that the scheme is simulation-secure, supports an arbitrary number of decryption queries, and uses a polynomial modulus. The paper also discusses related work, including previous threshold PKE schemes and their security properties. The paper presents a detailed analysis of the security of the proposed scheme, including the use of Gaussian noise and the hardness of LWE in the presence of leakage. It also discusses the use of Ring LWE and the implications of known-covariance RLWE for the security of the scheme. The paper concludes with a discussion of the practicality of the proposed scheme, including the use of concrete parameters and the potential for further research in the area of threshold PKE. The paper also highlights the importance of simulation security in threshold cryptography and the need for further research in this area.