How fair is your protocol? A utility-based approach to protocol optimality

DOI10.1145/2767386.2767431MaRDI QIDQ2796263zbMATH OpenOpenAlexFDO

Authors Juan Garay, Björn Tackmann, Vassilis Zikas, Jonathan 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

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

Recommendations

• Fair distributed computation of reactive functions
• Partial fairness in secure two-party computation
• Complete fairness in secure two-party computation
• Complete Fairness in Multi-party Computation without an Honest Majority
• Resource fairness and composability of cryptographic protocols

Cites work

• scientific article; zbMATH DE number 826255 (Why is no real title available?)
• Memorization and Association on a Realistic Neural Model

Cited in

(11)

• What security can we achieve within 4 rounds?
• Game-theoretic fairness meets multi-party protocols: the case of leader election
• A complete characterization of game-theoretically fair, multi-party coin toss
• Server-aided private set intersection based on reputation
• Fairness analysis for multiparty nonrepudiation protocols based on improved strand space
• What Security Can We Achieve Within 4 Rounds?
• Perfectly secure message transmission against independent rational adversaries
• scientific article; zbMATH DE number 2084607 (Why is no real title available?)
• Theory of Cryptography
• \(\log^\ast\)-round game-theoretically-fair leader election
• Maximizing miner revenue in transaction fee mechanism design

This page was built for publication: How fair is your protocol? A utility-based approach to protocol optimality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796263)