Two-round multiparty secure computation minimizing public key operations

DOI10.1007/978-3-319-96878-0_10zbMATH Open1457.94210OpenAlexW2794514891MaRDI QIDQ775971FDOQ775971

Authors: Sanjam Garg, Peihan Miao, Akshayaram Srinivasan 

Publication date: 30 June 2020

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

Recommendations

• Two-round multiparty secure computation from minimal assumptions
• Three-round secure multiparty computation from black-box two-round oblivious transfer
• scientific article; zbMATH DE number 1942420
• Secure computation with minimal interaction, revisited
• Perfect secure computation in two rounds

zbMATH Keywords

malicious two-round multiparty secure computation protocolssemi-honest two-round multiparty secure computation protocols

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (6)

• Two-round Multiparty Secure Computation from Minimal Assumptions
• Broadcast-optimal two-round MPC
• Two-round multiparty secure computation from minimal assumptions
• Efficient and round-optimal oblivious transfer and commitment with adaptive security
• Multiparty reusable non-interactive secure computation from LWE
• Efficient secure two-party exponentiation

This page was built for publication: Two-round multiparty secure computation minimizing public key operations

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