Communication-efficient MPC for general adversary structures

DOI10.1007/978-3-319-10879-7_10MaRDI QIDQ2922658zbMATH OpenOpenAlexFDO

Authors Joshua Lampkins, Rafail Ostrovsky

Publication date 14 October 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-10879-7_10

zbMATH Keywords

secret sharingmultiparty computationmonotone span programgeneral adversariesQ2 adversary structures

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• Efficient general-adversary multi-party computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Scalable and Unconditionally Secure Multiparty Computation
• Player simulation and general adversary structures in perfect multiparty computation
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries

Cited in

(9)

• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Reducing communication channels in MPC
• Error detection in monotone span programs with application to communication-efficient multi-party computation
• Efficient general-adversary multi-party computation
• Communication-efficient unconditional MPC with guaranteed output delivery
• Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries
• Broadcast from minicast secure against general adversaries
• scientific article; zbMATH DE number 1504552 (Why is no real title available?)
• Perfectly-Secure MPC with Linear Communication Complexity

This page was built for publication: Communication-efficient MPC for general adversary structures

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