On homomorphic secret sharing from polynomial-modulus LWE

DOI10.1007/978-3-031-31371-4_1MaRDI QIDQ6067348zbMATH OpenOpenAlexFDO

Authors Thomas Attema, Pedro Capitão, Lisa Kohl

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

zbMATH Keywords

additive reconstructionlearning with error

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Homomorphic secret sharing from lattices without FHE
• Foundations of homomorphic secret sharing
• Succinct homomorphic secret sharing
• Large message homomorphic secret sharing from DCR and applications
• A geometric approach to homomorphic secret sharing

Cites work

• A toolkit for ring-LWE cryptography
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Breaking the circuit size barrier for secure computation under DDH
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Distributed Point Functions and Their Applications
• Efficient pseudorandom correlation generators: silent OT extension and more
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Foundations of homomorphic secret sharing
• Function secret sharing
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Homomorphic secret sharing from lattices without FHE
• Homomorphic secret sharing from Paillier encryption
• How to share a secret
• Large message homomorphic secret sharing from DCR and applications
• Learning with rounding, revisited. New reduction, properties and applications
• 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
• On the hardness of learning with rounding over small modulus
• Pseudorandom functions and lattices
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• Spooky Encryption and Its Applications
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Worst-case to average-case reductions for module lattices

Cited in

(12)

• Recent advances in function and homomorphic secret sharing (invited talk)
• Homomorphic secret sharing from lattices without FHE
• scientific article; zbMATH DE number 1500489 (Why is no real title available?)
• scientific article; zbMATH DE number 7759464 (Why is no real title available?)
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• Multi-key homomorphic secret sharing from LWE without multi-key HE
• LERNA: secure single-server aggregation via key-homomorphic masking
• Succinct homomorphic secret sharing
• Efficient mixed garbling from homomorphic secret sharing and GGM-tree
• Threshold homomorphic secret sharing: definitions and constructions
• Pseudorandom correlation functions for garbled circuits
• Malicious homomorphic secret sharing with applications to DV-NIZK and more

This page was built for publication: On homomorphic secret sharing from polynomial-modulus LWE

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