Lattice-based multi-message multi-recipient KEM/PKE with malicious security
From MaRDI portal
Cites work
- (Leveled) fully homomorphic encryption without bootstrapping
- A simple and efficient CCA-secure lattice KEM in the standard model
- Fast polynomial factorization and modular composition
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- scientific article; zbMATH DE number 2085421 (Why is no real title available?)
- scientific article; zbMATH DE number 2081087 (Why is no real title available?)
- Lattice-based dual receiver encryption and more
- Lossy Trapdoor Functions and Their Applications
- Multiparty computation with low communication, computation and interaction via threshold FHE
- Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
- Oblivious message retrieval
- On ideal lattices and learning with errors over rings
- Practical dual-receiver encryption. Soundness, complete non-malleability, and applications
- Randomness Re-use in Multi-recipient Encryption Schemeas
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications
- Secure integration of asymmetric and symmetric encryption schemes
- Snake-eye resistant PKE from LWE for oblivious message retrieval and robust encryption
- The Knowledge Complexity of Interactive Proof Systems
- The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
- Toward practical lattice-based proof of knowledge from Hint-MLWE
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
This page was built for publication: Lattice-based multi-message multi-recipient KEM/PKE with malicious security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228254)
