Towards round-optimal secure multiparty computations: multikey FHE without a CRS

DOI10.1007/978-3-319-93638-3_7zbMATH Open1444.94078OpenAlexW2921955359MaRDI QIDQ1784443FDOQ1784443

Authors: Eunkyung Kim, Hyang-Sook Lee, Jeongeun Park 

Publication date: 26 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-93638-3_7

Recommendations

• Towards round-optimal secure multiparty computations: multikey FHE without a CRS
• Two round multiparty computation via multi-key FHE
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• A new approach to round-optimal secure multiparty computation
• Round optimal secure multiparty computation from minimal assumptions
• An efficient approach for secure multi-party computation without authenticated channel
• Round-optimal secure multiparty computation with honest majority
• Sublinear-communication secure multiparty computation does not require FHE
• \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds

zbMATH Keywords

Multikey fully homomorphic encryption (MFHE)secure multiparty computation (MPC) protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (2)

• Two round multiparty computation via multi-key FHE
• Towards round-optimal secure multiparty computations: multikey FHE without a CRS

This page was built for publication: Towards round-optimal secure multiparty computations: multikey FHE without a CRS

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