A geometric approach to homomorphic secret sharing

DOI10.1007/978-3-030-75248-4_4zbMath1479.94324OpenAlexW3165049123MaRDI QIDQ2061949

Giulio Malavolta, Yuval Ishai, Russell W. F. Lai

Publication date: 21 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_4

zbMATH Keywords

\((n, m, t)\)-homomorphic secret sharingcommunication-efficient secure multi-party computation

Mathematics Subject Classification ID

Cryptography (94A60) Theory of compilers and interpreters (68N20) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of partial derivatives
• Generalization of the formula of Faa di Bruno for a composite function with a vector argument
• Homomorphic secret sharing for low degree polynomials
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Secure computation with preprocessing via function secret sharing
• Homomorphic secret sharing from lattices without FHE
• A note on the communication complexity of multiparty computation in the correlated randomness model
• Efficient pseudorandom correlation generators: silent OT extension and more
• Communication vs. computation
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• Improved upper bounds on information-theoretic private information retrieval (extended abstract)
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Private Database Queries Using Somewhat Homomorphic Encryption
• How to share a secret
• Packed Homomorphic Encryption Based on Ideal Lattices and Its Application to Biometrics
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Efficient and Secure Evaluation of Multivariate Polynomials and Applications
• Foundations of Cryptography
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• ML Confidential: Machine Learning on Encrypted Data
• Foundations of Homomorphic Secret Sharing
• Fully homomorphic encryption using ideal lattices
• High-rate codes with sublinear-time decoding
• Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems
• Theory of Cryptography
• On the Cryptographic Complexity of the Worst Functions

This page was built for publication: A geometric approach to homomorphic secret sharing