Constant-round linear-broadcast secure computation with penalties

DOI10.1016/J.TCS.2023.113874arXiv2206.06010OpenAlexW4365143614MaRDI QIDQ6041674FDOQ6041674

Authors: Takeshi Nakai, Kazumasa Shinagawa 

Publication date: 12 May 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Abstract: It is known that Bitcoin enables achieving fairness in secure computation by imposing monetary penalties on adversarial parties. This functionality is called secure computation with penalties. Bentov and Kumaresan (Crypto 2014) introduced the claim-or-refund functionality that can be implemented via Bitcoin. They achieved secure computation with penalties with $O(n)$ rounds and $O(n)$ broadcasts for any function, where $n$ is the number of parties. After that, Kumaresan and Bentov (CCS 2014) showed a constant-round protocol. Unfortunately, this protocol requires $O(n^2)$ broadcasts. As far as we know, no protocol achieves $O(1)$ rounds and $O(n)$ broadcasts based on Bitcoin. This work accomplishes such efficiency in secure computation with penalties. We first show a protocol in a slightly relaxed setting called secure computation with non-equivalent penalties. This setting is the same as secure computation with penalties except that every honest party receives more than a predetermined amount of compensation, while the previous one requires that every honest party receives the same amount of compensation. Namely, our setting allows the compensations for honest parties to be non-equivalent. Moreover, we present a technique to remove the non-equivalence of our protocol without sacrificing efficiency. We then propose a new ideal functionality called claim-refund-or-give that can be implemented via Bitcoin.

Full work available at URL: https://arxiv.org/abs/2206.06010

Recommendations

• scientific article; zbMATH DE number 1842488
• Concurrently secure computation in constant rounds
• Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values
• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Constant-round multiparty private function evaluation with (quasi-)linear complexities
• Round-optimal secure multi-party computation
• Round-optimal secure multi-party computation
• Round-Efficient Secure Computation in Point-to-Point Networks
• Adaptively secure, universally composable, multiparty computation in constant rounds

zbMATH Keywords

fairnesssecure computationbitcoin

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Founding Cryptography on Oblivious Transfer – Efficiently
• How to use bitcoin to design fair protocols
• Adaptively secure broadcast, revisited
• Fair and robust multi-party computation using a global transaction ledger
• Legally-Enforceable Fairness in Secure Two-Party Computation
• Instantaneous decentralized poker
• Financially backed covert security

Cited In (1)

• Constant-deposit multiparty lotteries on Bitcoin for arbitrary number of players and winners

This page was built for publication: Constant-round linear-broadcast secure computation with penalties

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