Secure Computation with Minimal Interaction, Revisited

DOI10.1007/978-3-662-48000-7_18zbMath1352.94075OpenAlexW1459532868MaRDI QIDQ3457074

Yuval Ishai, Anat Paskin-Cherniavsky, Ranjit Kumaresan, Eyal Kushilevitz

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48000-7_18

zbMATH Keywords

efficiencyround complexitysecure multiparty computation

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Broadcast-optimal two round MPC with an honest majority, On the round complexity of black-box secure MPC, High throughput secure MPC over small population in hybrid networks (extended abstract), Round-optimal and communication-efficient multiparty computation, Round-optimal black-box protocol compilers, CNF-FSS and Its Applications, Minimizing setup in broadcast-optimal two round MPC, Round-optimal black-box secure computation from two-round malicious OT, Attaining GOD beyond honest majority with friends and foes, Two-round MPC without round collapsing revisited -- towards efficient malicious protocols, Round-optimal black-box MPC in the plain model, On the exact round complexity of best-of-both-worlds multi-party computation, Efficient fully secure computation via distributed zero-knowledge proofs, On communication models and best-achievable security in two-round MPC, Beyond honest majority: the round complexity of fair and robust multi-party computation, On the exact round complexity of secure three-party computation, Broadcast-optimal two-round MPC

Cites Work

• Verifiable secret sharing in a total of three rounds
• A lower bound for the time to assure interactive consistency
• Secure multi-party computation without agreement
• Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
• Multiparty Computation from Somewhat Homomorphic Encryption
• Semi-homomorphic Encryption and Multiparty Computation
• The Round Complexity of Verifiable Secret Sharing Revisited
• Secure Multiparty Computation with Minimal Interaction
• Secure Multi-party Computation Minimizing Online Rounds
• Secure Multiparty Computation Goes Live
• On the Power of Correlated Randomness in Secure Computation
• Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing
• Round-Efficient Secure Computation in Point-to-Point Networks
• Two-Round Secure MPC from Indistinguishability Obfuscation
• On the Cryptographic Complexity of the Worst Functions