Homomorphic secret sharing for low degree polynomials

DOI10.1007/978-3-030-03332-3_11MaRDI QIDQ1710675zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
• A geometric approach to homomorphic secret sharing
• Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
• Verifiable homomorphic secret sharing

Cites work

• scientific article; zbMATH DE number 1670848 (Why is no real title available?)
• scientific article; zbMATH DE number 5485460 (Why is no real title available?)
• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 1304086 (Why is no real title available?)
• scientific article; zbMATH DE number 1754644 (Why is no real title available?)
• 3-query locally decodable codes of subexponential length
• A Greedy Heuristic for the Set-Covering Problem
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Breaking the circuit size barrier for secure computation under DDH
• Computationally private randomizing polynomials and their applications
• Distributed Point Functions and Their Applications
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Foundations of homomorphic secret sharing
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Fully homomorphic encryption using ideal lattices
• Function secret sharing
• Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
• Homomorphic secret sharing from Paillier encryption
• How to share a secret
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• On \(d\)-multiplicative secret sharing
• Probabilistic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Simultaneous messages vs. communication
• Spooky Encryption and Its Applications
• Theory of Cryptography

Cited in

(11)

• Verifiable homomorphic secret sharing
• scientific article; zbMATH DE number 1500489 (Why is no real title available?)
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• scientific article; zbMATH DE number 7759464 (Why is no real title available?)
• Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials
• A geometric approach to homomorphic secret sharing
• Homomorphic secret sharing from lattices without FHE
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
• Evolving homomorphic secret sharing for hierarchical access structures
• Multi-key homomorphic secret sharing from LWE without multi-key HE

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

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