Round Efficient Unconditionally Secure Multiparty Computation Protocol

DOI10.1007/978-3-540-89754-5_15MaRDI QIDQ5504622zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Information Theoretic SecurityMultiparty Computation

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 1304080 (Why is no real title available?)
• Multiparty computation, an introduction
• Optimally efficient multi-valued byzantine agreement
• Perfectly-Secure MPC with Linear Communication Complexity
• Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
• Scalable and Unconditionally Secure Multiparty Computation
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Theory of Cryptography
• Universal classes of hash functions

Cited in

(7)

• Efficient asynchronous verifiable secret sharing and multiparty computation
• Near-linear unconditionally-secure multiparty computation with a dishonest minority
• Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
• scientific article; zbMATH DE number 1952911 (Why is no real title available?)
• scientific article; zbMATH DE number 1842487 (Why is no real title available?)
• The round complexity of statistical MPC with optimal resiliency
• Perfect (parallel) broadcast in constant expected rounds via statistical VSS

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)