Secure computation with minimal interaction, revisited

DOI10.1007/978-3-662-48000-7_18MaRDI QIDQ3457074zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Secure multiparty computation with minimal interaction
• scientific article; zbMATH DE number 1942420
• Round-optimal secure multi-party computation
• Two-round multiparty secure computation from minimal assumptions
• Round-optimal secure multiparty computation with honest majority

Cites work

• A lower bound for the time to assure interactive consistency
• Constant-overhead secure computation of Boolean circuits using preprocessing
• Multiparty Computation from Somewhat Homomorphic Encryption
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On the Cryptographic Complexity of the Worst Functions
• On the power of correlated randomness in secure computation
• Round-Efficient Secure Computation in Point-to-Point Networks
• Secure multi-party computation minimizing online rounds
• Secure multi-party computation without agreement
• Secure multiparty computation goes live
• Secure multiparty computation with minimal interaction
• Semi-homomorphic encryption and multiparty computation
• The Round Complexity of Verifiable Secret Sharing Revisited
• Two-round secure MPC from indistinguishability obfuscation
• Verifiable secret sharing in a total of three rounds

Cited in

(30)

• Fine-grained secure computation
• Secure computation with low communication from cross-checking
• Broadcast-optimal two-round MPC
• The resiliency of MPC with low interaction: the benefit of making errors (extended abstract)
• 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
• Reusable non-interactive secure computation
• On the exact round complexity of best-of-both-worlds multi-party computation
• Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation?
• Efficient fully secure computation via distributed zero-knowledge proofs
• On communication models and best-achievable security in two-round MPC
• Secure multiparty computation with minimal interaction
• CNF-FSS and its applications
• Unconditionally secure computation with reduced interaction
• On the exact round complexity of secure three-party computation
• On the exact round complexity of secure three-party computation
• Minimizing setup in broadcast-optimal two round MPC
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• 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
• Broadcast-optimal two round MPC with asynchronous peer-to-peer channels
• Threshold-optimal MPC with friends and foes
• Efficient multiparty private simultaneous messages for symmetric functions
• On the communication complexity of PSM and CDS for symmetric functions
• Two-round multiparty secure computation minimizing public key operations

This page was built for publication: Secure computation with minimal interaction, revisited

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