Revisiting module lattice-based homomorphic encryption and application to secure-MPC

DOI10.62056/AY7QJP10MaRDI QIDQ7346666zbMATH OpenFDO

Authors Anisha Mukherjee, Sujoy Sinha Roy

Publication date 11 September 2026

Published in Unnamed Author (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• A full RNS variant of approximate homomorphic encryption
• Actively secure setup for SPDZ
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• Black-box circular-secure encryption beyond affine functions
• Bounded key-dependent message security
• Efficient circuit-size independent public key encryption with KDM security
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• FINALLY: a multi-key FHE scheme based on NTRU and LWE
• Homomorphic encryption for arithmetic of approximate numbers
• scientific article; zbMATH DE number 1808209 (Why is no real title available?)
• Joint encryption and message-efficient secure computation
• Multi-key homomorphic encryption from TFHE
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On ideal lattices and learning with errors over rings
• On the hardness of module learning with errors with short distributions
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Practical and efficient FHE-based MPC
• Rinocchio: SNARKs for ring arithmetic
• Short Stickelberger class relations and application to Ideal-SVP
• Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus
• TFHE: fast fully homomorphic encryption over the torus
• Universally composable security: a new paradigm for cryptographic protocols
• Which ring based somewhat homomorphic encryption scheme is best?
• Worst-case to average-case reductions for module lattices

This page was built for publication: Revisiting module lattice-based homomorphic encryption and application to secure-MPC

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