Cryptography and Game Theory: Designing Protocols for Exchanging Information

DOI10.1007/978-3-540-78524-8_18zbMath1162.94378OpenAlexW2120391870MaRDI QIDQ5445513

Gillat Kol, Moni Naor

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_18

Mathematics Subject Classification ID

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

Related Items (24)

One-time rational secret sharing scheme based on bayesian game ⋮ Bayesian mechanism for rational secret sharing scheme ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ An optimally fair coin toss ⋮ Toward a game theoretic view of secure computation ⋮ A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer ⋮ Fully leakage-resilient signatures ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ A game-theoretic security framework for quantum cryptography: performance analysis and application ⋮ Utility dependence in correct and fair rational secret sharing ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ Secure message transmission on directed networks ⋮ The meeting businessmen problem: requirements and limitations ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ Realistic versus Rational Secret Sharing ⋮ Establishing rational networking using the DL04 quantum secure direct communication protocol ⋮ Unmediated communication with partially verifiable types ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Non-interactive zero knowledge from sub-exponential DDH ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Economically Optimal Variable Tag Length Message Authentication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of security of Yao's protocol for two-party computation
• Probabilistic encryption
• New hash functions and their use in authentication and set equality
• Correlation without mediation: Expanding the set of equilibrium outcomes by ``cheap pre-play procedures
• Unmediated communication in games with complete and incomplete information.
• Cheap talk in games with incomplete information.
• Non-cooperative computation: Boolean functions with correctness and exclusivity
• Timed Release of Standard Digital Signatures
• How to share a secret
• A complete problem for statistical zero knowledge
• Rational Secret Sharing, Revisited
• Rational secret sharing and multiparty computation
• Collusion-free protocols
• Oblivious Transfer Is Symmetric
• Fair Distribution Protocols or How the Players Replace Fortune
• Foundations of Cryptography
• Distributed computing meets game theory
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Computational Complexity and Communication: Coordination in Two-Player Games
• Completely fair SFE and coalition-safe cheap talk
• Rationality and Adversarial Behavior in Multi-party Computation

This page was built for publication: Cryptography and Game Theory: Designing Protocols for Exchanging Information