More Robust Multiparty Protocols with Oblivious Transfer

From Simple Sci Wiki
Revision as of 01:56, 24 December 2023 by SatoshiNakamoto (talk | contribs) (Created page with "Title: More Robust Multiparty Protocols with Oblivious Transfer Abstract: This research focuses on creating more robust multiparty protocols that use oblivious transfer. Oblivious transfer allows for the secure computation of functions between multiple parties, even in the presence of a faulty majority. However, all known protocols can be aborted by a single disruptor. The study presents more robust solutions for multiparty protocols with oblivious transfer, offering a...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Title: More Robust Multiparty Protocols with Oblivious Transfer

Abstract: This research focuses on creating more robust multiparty protocols that use oblivious transfer. Oblivious transfer allows for the secure computation of functions between multiple parties, even in the presence of a faulty majority. However, all known protocols can be aborted by a single disruptor. The study presents more robust solutions for multiparty protocols with oblivious transfer, offering a trade-off between robustness and security. The research also explores the application of quantum multiparty protocols, which allow for the implementation of oblivious transfer and the protocols presented in this paper.

Main Question: How can we create more robust multiparty protocols with oblivious transfer, maintaining security while reducing the risk of disruption?

Methodology: The study uses the concept of adversary structures, which represent possible collusions between players. The research defines four properties for multiparty protocols: A-security, A-partially correct, A-correct, and A-fairness. These properties ensure that no single collusion can obtain secret information, modify the result, or disrupt the protocol, while also preventing any collusion from reconstructing the result earlier than all honest participants.

Results: The research presents more robust multiparty protocols that meet the defined properties. These protocols can withstand a single disruptor, ensuring that the protocol cannot be aborted without being identified. The study also discusses the application of these protocols to quantum multiparty protocols, which allow for the implementation of oblivious transfer and the protocols presented in this paper.

Implications: The research has significant implications for the field of secure multiparty computation. The more robust protocols presented in this study can protect against disruptors, making it possible to create secure networks for various applications. The application of these protocols to quantum multiparty protocols opens up new possibilities for secure computation in quantum networks.

Link to Article: https://arxiv.org/abs/0101020v1 Authors: arXiv ID: 0101020v1

Retrieved from "https://simplesci.org/index.php?title=More_Robust_Multiparty_Protocols_with_Oblivious_Transfer&oldid=790"