Communication-Efficient MPC for General Adversary Structures

DOI10.1007/978-3-319-10879-7_10zbMath1423.68184OpenAlexW1573649732MaRDI QIDQ2922658

Rafail Ostrovsky, Joshua Lampkins

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

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

Related Items (2)

Broadcast from Minicast Secure Against General Adversaries ⋮ Perfectly-secure asynchronous MPC for general adversaries (extended abstract)

This page was built for publication: Communication-Efficient MPC for General Adversary Structures