scientific article; zbMATH DE number 1759774
From MaRDI portal
Publication:4536797
zbMATH Open1001.91002MaRDI QIDQ4536797FDOQ4536797
Authors: Yevgeniy Dodis, Shai Halevi, Tal Rabin 
Publication date: 28 July 2002
Title of this publication is not available (Why is that?)
Recommendations
Cited In (27)
- Title not available (Why is that?)
- A simple model of secure public communication
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- Communication optimal Tardos-based asymmetric fingerprinting
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- A rational approach to cryptographic protocols
- Financial Cryptography
- Game theoretic notions of fairness in multi-party coin toss
- Correlated equilibria and communication in games
- A solution of the misère Shannon switching game
- The role of a-priori information in networks of rational agents
- Efficient Correlated Action Selection
- Cryptography and Game Theory: Designing Protocols for Exchanging Information
- Limits on the power of cryptographic cheap talk
- Toward a game theoretic view of secure computation
- Bridging Game Theory and Cryptography: Recent Results and Future Directions
- Perfect implementation
- A complete characterization of game-theoretically fair, multi-party coin toss
- Algorithmic rationality: game theory with costly computation
- A quantum protocol for sampling correlated equilibria unconditionally and without a mediator
- Cryptography and game theory
- A rational framework for secure communication
- \(\log^\ast\)-round game-theoretically-fair leader election
- Solution of the Hotelling's game in secure strategies
- Computer science and decision theory
- A uniform min-max theorem with applications in cryptography
- When is a semi-honest secure multiparty computation valuable?
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536797)
