How Fair is Your Protocol?

DOI10.1145/2767386.2767431zbMath1333.94035OpenAlexW2046131987MaRDI QIDQ2796263

Vassilis Zikas, Björn Tackmann, Juan A. Garay, Jonathan N. Katz

Publication date: 23 March 2016

Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2767386.2767431

zbMATH Keywords

security

Mathematics Subject Classification ID

Cryptography (94A60) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (7)

Game-theoretic fairness meets multi-party protocols: the case of leader election ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ What security can we achieve within 4 rounds? ⋮ Server-aided private set intersection based on reputation ⋮ What Security Can We Achieve Within 4 Rounds?

Cites Work

• Unnamed Item
• Memorization and Association on a Realistic Neural Model

This page was built for publication: How Fair is Your Protocol?