Welcome to the resource topic for 2022/1655
Title:
Just How Fair is an Unreactive World?
Authors: Srinivasan Raghuraman, Yibin Yang
Abstract:Fitzi, Garay, Maurer, and Ostrovsky (J. Cryptology 2005) showed that in the presence of a dishonest majority, no primitive of cardinality n - 1 is complete for realizing an arbitrary n-party functionality with guaranteed output delivery. In this work, we show that in the presence of n - 1 corrupt parties, no unreactive primitive of cardinality n - 1 is complete for realizing an arbitrary n-party functionality with fairness. We show more generally that for t > \frac{n}{2}, in the presence of t malicious parties, no unreactive primitive of cardinality t is complete for realizing an arbitrary n-party functionality with fairness. We complement this result by noting that (t+1)-wise fair exchange is complete for realizing an arbitrary n-party functionality with fairness. In order to prove our results, we utilize the primitive of fair coin tossing and introduce the notion of predictability in coin tossing protocols, which we believe is of independent interest.
ePrint: https://eprint.iacr.org/2022/1655
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .