Homomorphic secret sharing for low degree polynomials

DOI10.1007/978-3-030-03332-3_11zbMath1447.94063OpenAlexW2898583552MaRDI QIDQ1710675

Russell W. F. Lai, Giulio Malavolta, Dominique Schröder

Publication date: 23 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-03332-3_11

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Evolving homomorphic secret sharing for hierarchical access structures ⋮ Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN ⋮ A geometric approach to homomorphic secret sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(d\)-multiplicative secret sharing
• Probabilistic encryption
• Homomorphic secret sharing from Paillier encryption
• Computationally private randomizing polynomials and their applications
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Function Secret Sharing
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• How to share a secret
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• A Greedy Heuristic for the Set-Covering Problem
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Simultaneous messages vs. communication
• Foundations of Homomorphic Secret Sharing
• 3-query locally decodable codes of subexponential length
• Fully homomorphic encryption using ideal lattices
• Distributed Point Functions and Their Applications
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Theory of Cryptography
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation

This page was built for publication: Homomorphic secret sharing for low degree polynomials