Reducing the Overhead of MPC over a Large Population

DOI10.1007/978-3-319-10879-7_12MaRDI QIDQ2922660zbMATH OpenOpenAlexFDO

Authors Ashish Choudhury, Arpita Patra, N. P. Smart

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_12

Mathematics Subject Classification ID

Network protocols (68M12) Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Recommendations

• The more the merrier: reducing the cost of large scale MPC
• Computational burden reduction in min-max MPC
• On the computational overhead of MPC with dishonest majority
• Efficient, oblivious data structures for MPC
• Controlling the level of sparsity in MPC
• scientific article; zbMATH DE number 2090645
• An efficient MPC algorithm with larger attraction region

Cited in

(1)

• On the computational overhead of MPC with dishonest majority

This page was built for publication: Reducing the Overhead of MPC over a Large Population

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