Homomorphic secret sharing for low degree polynomials
type: Item
instance of: scholarly article
title: Homomorphic secret sharing for low degree polynomials
zbMATH Open document ID: 1447.94063
DOI: 10.1007/978-3-030-03332-3_11
author: Russell W. F. Lai
author: Giulio Malavolta
author: Dominique Schröder
publication date: 2019-01-23T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7005642
MaRDI profile type: Publication
full work available at URL: 978-3-030-03332-3 11
OpenAlex ID: W2898583552
cites work: Computationally private randomizing polynomials and their applications
cites work: Simultaneous messages vs. communication
cites work: On \(d\)-multiplicative secret sharing
cites work: Q4535072
cites work: Q3778674
cites work: Theory of Cryptography
cites work: Function Secret Sharing
cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH
cites work: Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
cites work: Foundations of Homomorphic Secret Sharing
cites work: Q2754171
cites work: Q4250776
cites work: Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Spooky Encryption and Its Applications
cites work: 3-query locally decodable codes of subexponential length
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
cites work: Homomorphic secret sharing from Paillier encryption
cites work: Efficient and Secure Evaluation of Multivariate Polynomials and Applications
cites work: Fully homomorphic encryption using ideal lattices
cites work: Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
cites work: Distributed Point Functions and Their Applications
cites work: Probabilistic encryption
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: How to share a secret
cites work: Q3549622
description: scientific article; zbMATH DE number 7005642