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

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

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

Cites work

• scientific article; zbMATH DE number 1670848 (Why is no real title available?)
• A Generalization of Hermite's Interpolation Formula
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• A geometric approach to homomorphic secret sharing
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Amortized complexity of information-theoretically secure MPC revisited
• Batch fully homomorphic encryption over the integers
• Breaking the circuit size barrier for secure computation under DDH
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Converting pairing-based cryptosystems from composite-order groups to prime-order groups
• Efficient pseudorandom correlation generators: silent OT extension and more
• Fully homomorphic SIMD operations
• Fully homomorphic encryption using ideal lattices
• Homomorphic secret sharing for low degree polynomials
• Homomorphic secret sharing from lattices without FHE
• How to share a secret
• Ideal secret sharing schemes for useful multipartite access structures
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• ML confidential: machine learning on encrypted data
• Multiparty Computation from Somewhat Homomorphic Encryption
• New directions in cryptography
• On \(d\)-multiplicative secret sharing
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Random Graphs
• Spooky Encryption and Its Applications
• Theory of Cryptography
• TinyKeys: a new approach to efficient multi-party computation
• d-Multiplicative Secret Sharing for Multipartite Adversary Structures

Cited in

(9)

• Parallel Multi-party Computation from Linear Multi-secret Sharing Schemes
• Foundations of homomorphic secret sharing
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Ideal uniform multipartite secret sharing schemes
• A geometric approach to homomorphic secret sharing
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Multi-key homomorphic secret sharing from LWE without multi-key HE
• Homomorphic secret sharing for low degree polynomials

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)