Generalized pseudorandom secret sharing and efficient straggler-resilient secure computation

DOI10.1007/978-3-030-90453-1_5OpenAlexW3216909115MaRDI QIDQ2697852

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

Publication date: 13 April 2023

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

zbMATH Keywords

secure multiparty computationcheap straggler resiliencepseudorandom secret sharing

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Research problem 33
• What we know and what we do not know about Turán numbers
• Tight bounds for shared memory systems accessed by Byzantine processes
• Security and composition of multiparty cryptographic protocols
• Order-C secure multiparty computation for highly repetitive circuits
• The more the merrier: reducing the cost of large scale MPC
• Fluid MPC: secure multiparty computation with dynamic participants
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• How to share a secret
• Distributed agreement in the presence of processor and communication faults
• Foundations of Cryptography