Utility dependence in correct and fair rational secret sharing

DOI10.1007/s00145-010-9064-zzbMath1209.94034OpenAlexW2254427680MaRDI QIDQ2429715

Yehuda Lindell, Gilad Asharov

Publication date: 1 April 2011

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.157.4000

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

Game theoretic notions of fairness in multi-party coin toss, Toward a game theoretic view of secure computation, A complete characterization of game-theoretically fair, multi-party coin toss, \(\log^\ast\)-round game-theoretically-fair leader election, Rational quantum secret sharing scheme based on GHZ state, Perfectly Secure Message Transmission Against Independent Rational Adversaries, RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS, Quantum secure two-party computation for set intersection with rational players

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Coalition-proof Nash equilibria. I: Concepts
• How to share a secret
• Rational Secret Sharing, Revisited
• Rational secret sharing and multiparty computation
• Collusion-free protocols
• Fairness with an Honest Minority and a Rational Majority
• Distributed computing meets game theory
• Bridging Game Theory and Cryptography: Recent Results and Future Directions
• Lower Bounds on Implementing Robust and Resilient Mediators
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Completely fair SFE and coalition-safe cheap talk
• Rationality and Adversarial Behavior in Multi-party Computation