Improved building blocks for secure multi-party computation based on secret sharing with honest majority

DOI10.1007/978-3-030-57808-4_19OpenAlexW3081957293MaRDI QIDQ2229285

Ahreum Kang, Chen Yuan, Marina Blanton

Publication date: 23 February 2021

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

zbMATH Keywords

multiplicationsecret sharingsecure multi-party computationarray access at private location

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Related Items (2)

MPClan: protocol suite for privacy-conscious computations ⋮ Improved building blocks for secure multi-party computation based on secret sharing with honest majority

Cites Work

• Unnamed Item
• Estimating the dimension of a model
• Efficient maliciously secure multiparty computation for RAM
• 3PC ORAM with low latency, low bandwidth, and fast batch retrieval
• Improved building blocks for secure multi-party computation based on secret sharing with honest majority
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Three-Party ORAM for Secure Computation
• Efficient, Oblivious Data Structures for MPC
• How to share a secret
• Oblivious RAM with O((logN)3) Worst-Case Cost
• Improved Primitives for Secure Multiparty Integer Computation
• Scalable and Unconditionally Secure Multiparty Computation
• Software protection and simulation on oblivious RAMs
• Parent Assignment Is Hard for the MDL, AIC, and NML Costs
• Theory of Cryptography

This page was built for publication: Improved building blocks for secure multi-party computation based on secret sharing with honest majority