• DOI:10.1007/978-3-642-24100-0_16
• Corpus ID: 15221266

Leakage-Resilient Coin Tossing

@inproceedings{Boyle2011LeakageResilientCT,
  title={Leakage-Resilient Coin Tossing},
  author={Elette Boyle and Shafi Goldwasser and Yael Tauman Kalai},
  booktitle={DISC},
  year={2011}
}

• Elette Boyle, S. Goldwasser, Y. Kalai
• Published in DISC 20 September 2011
• Computer Science, Mathematics

The ability to collectively toss a common coin among n parties in the presence of faults is an important primitive in the arsenal of randomized distributed protocols. In the case of dishonest majority, it was shown to be impossible to achieve less than 1/r bias in O(r) rounds (Cleve STOC '86). In the case of honest majority, in contrast, unconditionally secure O(1)-round protocols for generating common unbiased coins follow from general completeness theorems on multi-party secure protocols in the secure channels model (e.g., BGW, CCD STOC '88).

However, in the O(1)-round protocols with honest majority, parties generate and hold secret values which are assumed to be perfectly hidden from malicious parties: an assumption which is crucial to proving the resulting common coin is unbiased. This assumption unfortunately does not seem to hold in practice, as attackers can launch side-channel attacks on the local state of honest parties and leak information on their secrets.

In this work, we present an O(1)-round protocol for collectively generating an unbiased common coin, in the presence of leakage on the local state of the honest parties. We tolerate t ≥ (1/3 - e)n computationallyunbounded Byzantine faults and in addition a Ω(1)-fraction leakage on each (honest) party's secret state. Our results hold in the memory leakage model (of Akavia, Goldwasser, Vaikuntanathan '08) adapted to the distributed setting.

Additional contributions of our work are the tools we introduce to achieve the collective coin toss: a procedure for disjoint committee election, and leakage-resilient verifiable secret sharing.