On 2-round secure multiparty computation

DOI10.1007/3-540-45708-9_12MaRDI QIDQ4409117zbMATH OpenFDO

Authors Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin

Publication date 30 June 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2442/24420178.htm

zbMATH Keywords

lower boundsround complexitysecure multiparty computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• Advances in Cryptology – CRYPTO 2004
• Perfect secure computation in two rounds
• Secure multiparty computation with minimal interaction
• The Exact Round Complexity of Secure Computation
• Round-optimal secure multiparty computation with honest majority

Cited in

(47)

• Parallel coin-tossing and constant-round secure two-party computation
• Perfect secure computation in two rounds
• On secure two-party computation in three rounds
• MPC with friends and foes
• 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
• Round-optimal black-box protocol compilers
• On fully secure MPC with solitary output
• Degree 2 is complete for the round-complexity of malicious MPC
• On the power of secure two-party computation
• On the exact round complexity of best-of-both-worlds multi-party computation
• On communication models and best-achievable security in two-round MPC
• One-round secure computation and secure autonomous mobile agents. (Extended abstract)
• On the Power of Secure Two-Party Computation
• Two-message, oblivious evaluation of cryptographic functionalities
• Broadcast (and round) efficient verifiable secret sharing
• Secure computation with minimal interaction, revisited
• Secure multiparty computation with minimal interaction
• Universally-Composable Two-Party Computation in Two Rounds
• The Power of Anonymous Veto in Public Discussion
• scientific article; zbMATH DE number 2009981 (Why is no real title available?)
• Parallel coin-tossing and constant-round secure two-party computation
• Perfect secure computation in two rounds
• Advances in Cryptology – CRYPTO 2004
• Round-Efficient Secure Computation in Point-to-Point Networks
• On the exact round complexity of self-composable two-party computation
• On the exact round complexity of secure three-party computation
• On perfectly secure 2PC in the OT-hybrid model
• Adaptively secure MPC with sublinear communication complexity
• Minimizing setup in broadcast-optimal two round MPC
• Beyond honest majority: the round complexity of fair and robust multi-party computation
• Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract)
• Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract)
• Round-optimal black-box secure computation from two-round malicious OT
• The round complexity of statistical MPC with optimal resiliency
• On the correlation complexity of MPC with cheater identification
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Randomized functions with high round complexity
• On the round complexity of fully secure solitary MPC with honest majority
• Threshold-optimal MPC with friends and foes
• Round-optimal, fully secure distributed key generation
• Your reputation's safe with me: framing-free distributed zero-knowledge proofs
• Peeking into the future: MPC resilient to super-rushing adversaries
• Single-input functionality against a dishonest majority: practical and round-optimal
• All Byzantine agreement problems are expensive
• Two-round multiparty secure computation minimizing public key operations

This page was built for publication: On 2-round secure multiparty computation

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