Uncovering algebraic structures in the MPC landscape

DOI10.1007/978-3-030-17656-3_14MaRDI QIDQ2292879zbMATH OpenOpenAlexFDO

Authors Navneet Agarwal, Sanat Anand, Manoj Prabhakaran

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17656-3_14

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
• Perfectly-Secure MPC with Linear Communication Complexity
• Secure multiparty computation with general interaction patterns
• Communication-efficient MPC for general adversary structures
• scientific article; zbMATH DE number 2009982

Cited in

(5)

• On fully secure MPC with solitary output
• On secure computation of solitary output functionalities with and without broadcast
• Additive randomized encodings and their applications
• Non-interactive secure multiparty computation for symmetric functions, revisited: more efficient constructions and extensions
• Can Alice and Bob guarantee output to Carol?

This page was built for publication: Uncovering algebraic structures in the MPC landscape

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