Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

DOI10.1007/978-3-030-90453-1_5MaRDI QIDQ2697852zbMATH OpenOpenAlexFDO

Authors Fabrice Benhamouda, Elette Boyle, Niv Gilboa, Shai Halevi, Yuval Ishai, Ariel Nof

Publication date 13 April 2023

Full work available at URL https://doi.org/10.1007/978-3-030-90453-1_5

zbMATH Keywords

cheap straggler resiliencepseudorandom secret sharingsecure multiparty computation

Mathematics Subject Classification ID

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

Recommendations

• Fast large-scale honest-majority MPC for malicious adversaries
• Proactive secure multiparty computation with a dishonest majority
• Fast large-scale honest-majority MPC for malicious adversaries
• Concrete efficiency improvements for multiparty garbling with an honest majority
• Perfectly-Secure MPC with Linear Communication Complexity

Cites work

• Distributed agreement in the presence of processor and communication faults
• Fluid MPC: secure multiparty computation with dynamic participants
• Foundations of Cryptography
• How to share a secret
• scientific article; zbMATH DE number 4200236 (Why is no real title available?)
• scientific article; zbMATH DE number 6866298 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Order-C secure multiparty computation for highly repetitive circuits
• Research problem 33
• Security and composition of multiparty cryptographic protocols
• The more the merrier: reducing the cost of large scale MPC
• Tight bounds for shared memory systems accessed by Byzantine processes
• What we know and what we do not know about Turán numbers
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

Cited in

(4)

• Approximate shared-memory counting despite a strong adversary
• Degree-D reverse multiplication-friendly embeddings: constructions and applications
• MPC with delayed parties over star-like networks
• Arctic: lightweight and stateless threshold Schnorr signatures

This page was built for publication: Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

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