On homomorphic secret sharing from polynomial-modulus LWE
From MaRDI portal
Publication:6067348
DOI10.1007/978-3-031-31371-4_1zbMath1526.94047OpenAlexW4367593110MaRDI QIDQ6067348
Thomas Attema, Lisa Kohl, Pedro Capitão
Publication date: 16 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_1
Cites Work
- On the concrete hardness of learning with errors
- Homomorphic secret sharing from Paillier encryption
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
- Large message homomorphic secret sharing from DCR and applications
- Homomorphic secret sharing from lattices without FHE
- Efficient pseudorandom correlation generators: silent OT extension and more
- Worst-case to average-case reductions for module lattices
- On the Hardness of Learning with Rounding over Small Modulus
- Spooky Encryption and Its Applications
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Learning with Rounding, Revisited
- Pseudorandom Functions and Lattices
- Function Secret Sharing
- How to share a secret
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- On Ideal Lattices and Learning with Errors over Rings
- A Toolkit for Ring-LWE Cryptography
- Foundations of Homomorphic Secret Sharing
- Distributed Point Functions and Their Applications
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing
- On lattices, learning with errors, random linear codes, and cryptography
- Scooby: improved multi-party homomorphic secret sharing based on FHE
This page was built for publication: On homomorphic secret sharing from polynomial-modulus LWE
