General Partially Fair Multi-Party Computation with VDFs.

Bolton Bailey, Andrew Miller, Or Sattath

Research output: Working paper/PreprintPreprint


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.
Original languageEnglish
PublisherCryptology ePrint Archive
StatePublished - 8 Oct 2022


  • Partial fairness
  • Multi-party computation
  • Verifiable Delay Functions


Dive into the research topics of 'General Partially Fair Multi-Party Computation with VDFs.'. Together they form a unique fingerprint.

Cite this