Simulation-secure threshold PKE from LWE with polynomial modulus

DOI10.62056/A0ZOGY4E-MaRDI QIDQ7326410zbMATH OpenFDO

Authors Daniele Micciancio, Adam Suhl

Publication date 9 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A0ZOGY4E-

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• Adding distributed decryption and key generation to a ring-LWE based CCA encryption scheme
• Asymptotically quasi-optimal cryptography
• Better key sizes (and attacks) for LWE-based encryption
• Efficient public key encryption based on ideal lattices (extended abstract)
• FHE circuit privacy almost for free
• Hardness of LWE on general entropic distributions
• How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE
• Improved discrete Gaussian and Subgaussian analysis for lattice cryptography
• Lossiness and entropic hardness for ring-LWE
• mrNISC from LWE with polynomial modulus
• Multiparty computation with low communication, computation and interaction via threshold FHE
• Multiparty reusable non-interactive secure computation from LWE
• New bounds in some transference theorems in the geometry of numbers
• Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings
• On ideal lattices and learning with errors over rings
• On lattices, learning with errors, random linear codes, and cryptography
• On the concrete hardness of learning with errors
• Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps
• Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions
• Round-optimal lattice-based threshold signatures, revisited
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• Threshold cryptosystems from threshold fully homomorphic encryption
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Toward practical lattice-based proof of knowledge from Hint-MLWE
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(4)

• IND-CCA lattice threshold KEM under 30 KiB
• Error-simulatable sanitization for TFHE and applications
• Leaky LWE: learning with errors with semi-adaptive secret- and error-leakage
• Threshold public-key encryption: definitions, relations, and CPA-to-CCA transforms

This page was built for publication: Simulation-secure threshold PKE from LWE with polynomial modulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7326410)