English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

As far as we know, the literature on secure computation from cut-and-choosehas focused on achieving computational security against malicious adversaries.It is unclear whether the idea of cut-and-choose can be adapted to securecomputation with information-theoretic security. In this work we explore thepossibility of using cut-and-choose in information theoretic setting for securethree-party computation (3PC). Previous work on 3PC has mainly focus on thesemi-honest case, and is motivated by the observation that real-worddeployments of multi-party computation (MPC) seem to involve few parties. Wepropose a new protocol for information-theoretically secure 3PC tolerating onemalicious party with cheating probability $2^{-s}$ using $s$ runs of circuitcomputation in the cut-and-choose paradigm. The computational cost of ourprotocol is essentially only a small constant worse than that ofstate-of-the-art 3PC protocols against a semi-honest corruption, while itscommunication round is greatly reduced compared to other maliciously secure 3PCprotocols in information-theoretic setting.

Efficient Three-party Computation: An Information-theoretic Approach from Cut-and-Choose