Toward a game theoretic view of secure computation
From MaRDI portal
Publication:321318
DOI10.1007/s00145-015-9212-6zbMath1365.94475OpenAlexW1165093146MaRDI QIDQ321318
Ran Canetti, Gilad Asharov, Carmit Hazay
Publication date: 13 October 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9212-6
Applications of game theory (91A80) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partial fairness in secure two-party computation
- Probabilistic encryption
- Utility dependence in correct and fair rational secret sharing
- On Fair Exchange, Fair Coins and Fair Sampling
- Fair Computation with Rational Players
- Efficient Rational Secret Sharing in Standard Communication Networks
- Rational Secret Sharing, Revisited
- Rational secret sharing and multiparty computation
- Fairness with an Honest Minority and a Rational Majority
- The Knowledge Complexity of Interactive Proof Systems
- Foundations of Cryptography
- Distributed computing meets game theory
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Verifiably Secure Devices
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Rationality and Adversarial Behavior in Multi-party Computation
- Theory of Cryptography
This page was built for publication: Toward a game theoretic view of secure computation
