### General Partially Fair Multi-Party Computation with VDFs

##### Abstract

Gordon and Katz, in "Partial Fairness in Secure Two-Party Computation", present a protocol for two-party computation with partial fairness which depends on presumptions on the size of the input or output of the functionality. They also show that for some other functionalities, this notion of partial fairness is impossible to achieve. In this work, we get around this impossibility result using verifiable delay functions, a primitive which brings in an assumption on the inability of an adversary to compute a certain function in a specified time. We present a gadget using VDFs which allows for any MPC to be carried out with ≈ 1/R partial fairness, where R is the number of communication rounds.

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
Partial Fairness Multi-Party Computation Verifiable Delay Functions
Contact author(s)
boltonb2 @ illinois edu
soc1024 @ illinois edu
sattath @ gmail com
History
2022-10-08: revised
See all versions
Short URL
https://ia.cr/2022/1318

CC BY

BibTeX

@misc{cryptoeprint:2022/1318,
author = {Bolton Bailey and Andrew Miller and Or Sattath},
title = {General Partially Fair Multi-Party Computation with VDFs},
howpublished = {Cryptology ePrint Archive, Paper 2022/1318},
year = {2022},
note = {\url{https://eprint.iacr.org/2022/1318}},
url = {https://eprint.iacr.org/2022/1318}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.