Toward a game theoretic view of secure computation

DOI10.1007/S00145-015-9212-6MaRDI QIDQ321318zbMATH OpenOpenAlexFDO

Authors Gilad Asharov, Ran Canetti, 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

zbMATH Keywords

fairnessgame theorysecure computation

Mathematics Subject Classification ID

Applications of game theory (91A80) Authentication, digital signatures and secret sharing (94A62) Network protocols (68M12)

Recommendations

• Towards a game theoretic view of secure computation
• Fair secure two-party computation protocol based on game theory
• Fair computation with rational players
• A Game-Theoretic Perspective on Oblivious Transfer
• Bridging Game Theory and Cryptography: Recent Results and Future Directions

Cites work

• scientific article; zbMATH DE number 4191105 (Why is no real title available?)
• scientific article; zbMATH DE number 5485554 (Why is no real title available?)
• scientific article; zbMATH DE number 503243 (Why is no real title available?)
• scientific article; zbMATH DE number 1759774 (Why is no real title available?)
• Bridging Game Theory and Cryptography: Recent Results and Future Directions
• Complete fairness in secure two-party computation
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Cryptography and game theory
• Distributed computing meets game theory
• Efficient rational secret sharing in standard communication networks
• Fair computation with rational players
• Fairness with an Honest Minority and a Rational Majority
• Foundations of Cryptography
• On fair exchange, fair coins and fair sampling
• Partial fairness in secure two-party computation
• Probabilistic encryption
• Rational Secret Sharing, Revisited
• Rational secret sharing and multiparty computation
• Rationality and Adversarial Behavior in Multi-party Computation
• The Knowledge Complexity of Interactive Proof Systems
• Theory of Cryptography
• Utility dependence in correct and fair rational secret sharing
• Verifiably Secure Devices

Cited in

(21)

• A Calculus for Game-Based Security Proofs
• Leakage and protocol composition in a game-theoretic perspective
• Distributed computing meets game theory
• Limits on the power of cryptographic cheap talk
• Theory of Cryptography
• Equilibrium concepts for rational multiparty computation
• Automated Game-Theoretic Verification of Security Systems
• Beyond Nash equilibrium: solution concepts for the 21st century
• Bit security as computational cost for winning games with high probability
• Towards a game theoretic view of secure computation
• Fair computation with rational players
• Game-Theoretic Analysis of an Incentivized Verifiable Computation System
• Fair secure two-party computation protocol based on game theory
• Perfectly secure message transmission against independent rational adversaries
• Cryptography and game theory
• Bridging Game Theory and Cryptography: Recent Results and Future Directions
• A rational framework for secure communication
• A rational approach to cryptographic protocols
• The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs
• scientific article; zbMATH DE number 1857530 (Why is no real title available?)
• Game-theoretic security for bit commitment

This page was built for publication: Toward a game theoretic view of secure computation

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