Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials

DOI10.1007/978-3-030-92075-3_7zbMATH Open1514.94152OpenAlexW3206496981MaRDI QIDQ6157516FDOQ6157516

Reo Eriguchi, Koji Nuida

Publication date: 12 May 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-030-92075-3_7

zbMATH Keywords

homomorphic secret sharingparallel evaluationgeneral adversary structure

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Fully homomorphic encryption using ideal lattices
• Random Graphs
• Theory of Cryptography
• How to share a secret
• A Generalization of Hermite's Interpolation Formula
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Multiparty Computation from Somewhat Homomorphic Encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Fully homomorphic SIMD operations
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• On \(d\)-multiplicative secret sharing
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Batch Fully Homomorphic Encryption over the Integers
• Amortized complexity of information-theoretically secure MPC revisited
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Linearly Homomorphic Encryption from $$\mathsf {DDH}$$
• TinyKeys: a new approach to efficient multi-party computation
• ML Confidential: Machine Learning on Encrypted Data
• Homomorphic secret sharing for low degree polynomials
• Homomorphic secret sharing from lattices without FHE
• Efficient pseudorandom correlation generators: silent OT extension and more
• A geometric approach to homomorphic secret sharing
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Ideal Secret Sharing Schemes for Useful Multipartite Access Structures
• d-Multiplicative Secret Sharing for Multipartite Adversary Structures

Cited In (4)

• Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• Ideal uniform multipartite secret sharing schemes
• Multi-key homomorphic secret sharing from LWE without multi-key HE

   Recommendations

• Homomorphic secret sharing for low degree polynomials 👍 👎
• A geometric approach to homomorphic secret sharing 👍 👎
• Foundations of Homomorphic Secret Sharing 👍 👎
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials 👍 👎
• Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes 👍 👎

This page was built for publication: Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials

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