IND-CCA Lattice Threshold KEM under 30 KiB

No abstract is available for this paper.

• Publication year

  2026

• Venue

  IACR Cryptology ePrint Archive

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Simulation-Secure Threshold PKE from LWE with Polynomial Modulus

  2025cited by this paper
• A Lattice-Based IND-CCA Threshold KEM from the BCHK+ Transform

  2025influential reference
• Threshold Signatures Reloaded: ML-DSA and Enhanced Raccoon with Identifiable Aborts

  2025cited by this paper
• Simple and Efficient Lattice Threshold Signatures with Identifiable Aborts

  2025cited by this paper
• Enhancing Threshold Group Action Signature Schemes: Adaptive Security and Scalability Improvements

  2025cited by this paper
• More Efficient Lattice-Based Electronic Voting from NTRU

  2025cited by this paper
• Adaptively Secure 5 Round Threshold Signatures from MLWE/MSIS and DL with Rewinding

  2024cited by this paper
• Mempool Privacy via Batched Threshold Encryption: Attacks and Defenses

  2024cited by this paper
• Plover: Masking-Friendly Hash-and-Sign Lattice Signatures

  2024cited by this paper
• Threshold Raccoon: Practical Threshold Signatures from Standard Lattice Assumptions

  2024cited by this paper
• Simple Threshold (Fully Homomorphic) Encryption From LWE With Polynomial Modulus

  2023cited by this paper
• Verifiable Mix-Nets and Distributed Decryption for Voting from Lattice-Based Assumptions

  2023cited by this paper
• Compact Lattice Gadget and Its Applications to Hash-and-Sign Signatures

  2023cited by this paper
• Toward Practical Lattice-based Proof of Knowledge from Hint-MLWE

  2023cited by this paper
• NTRU Fatigue: How Stretched is Overstretched?

  2021cited by this paper
• Non-interactive CCA2-Secure Threshold Cryptosystems: Achieving Adaptive Security in the Standard Model Without Pairings

  2021cited by this paper
• Revisiting Lattice Attacks on Overstretched NTRU Parameters

  2017cited by this paper
• A Modular Analysis of the Fujisaki-Okamoto Transformation

  2017cited by this paper
• A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes

  2016cited by this paper
• On the concrete hardness of Learning with Errors

  2015cited by this paper
• Lattice Signatures Without Trapdoors

  2012influential reference
• Bonsai Trees, or How to Delegate a Lattice Basis

  2010influential reference
• Trapdoors for hard lattices and new cryptographic constructions

  2008cited by this paper
• Chosen Ciphertext Secure Public Key Threshold Encryption Without Random Oracles

  2006cited by this paper
• Chosen-Ciphertext Security from Identity-Based Encryption

  2004cited by this paper
• Secure Integration of Asymmetric and Symmetric Encryption Schemes

  1999cited by this paper
• Multiplicative Non-abelian Sharing Schemes and their Application to Threshold Cryptography

  1994cited by this paper
• Signatures

  1871cited by this paper
• Gladius: LWR based efficient hybrid public key encryption with distributed decryption

  year unknowncited by this paper

• GPV Preimage Sampling with Weak Smoothness and Its Applications to Lattice Signatures

  2025cites this paper
• “Preview Writeup”: In anticipation of a package submission to the NIST Threshold Call Title

  year unknowncites this paper