Round Efficient Unconditionally Secure Multiparty Computation Protocol

DOI10.1007/978-3-540-89754-5_15zbMATH Open1203.94118OpenAlexW2150023103MaRDI QIDQ5504622FDOQ5504622

Authors: Arpita Patra, Ashish Choudhury, C. Pandu Rangan 

Publication date: 22 January 2009

Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89754-5_15

Recommendations

• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• An Efficient Framework for Unconditionally Secure Multiparty Computation
• Round-optimal and communication-efficient multiparty computation
• A new approach to round-optimal secure multiparty computation
• Round optimal secure multiparty computation from minimal assumptions
• Round-optimal secure multiparty computation with honest majority
• Theory of Cryptography
• Advances in Cryptology – CRYPTO 2004
• Scalable and Unconditionally Secure Multiparty Computation

zbMATH Keywords

Information Theoretic SecurityMultiparty Computation

Mathematics Subject Classification ID

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

Cites Work

• Universal classes of hash functions
• Title not available (Why is that?)
• Scalable and Unconditionally Secure Multiparty Computation
• Perfectly-Secure MPC with Linear Communication Complexity
• Title not available (Why is that?)
• Theory of Cryptography
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Optimally efficient multi-valued byzantine agreement
• Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
• Multiparty computation, an introduction

Cited In (7)

• Efficient asynchronous verifiable secret sharing and multiparty computation
• Title not available (Why is that?)
• Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
• Title not available (Why is that?)
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• The round complexity of statistical MPC with optimal resiliency

This page was built for publication: Round Efficient Unconditionally Secure Multiparty Computation Protocol

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