Pages that link to "Item:Q5445510"

The following pages link to Bridging Game Theory and Cryptography: Recent Results and Future Directions (Q5445510):

Displaying 22 items.

• Toward a game theoretic view of secure computation (Q321318) (← links)
• \texttt{FlipIt}: the game of ``stealthy takeover'' (Q380966) (← links)
• Unmediated communication with partially verifiable types (Q533921) (← links)
• Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
• Correlation and unmediated cheap talk in repeated games with imperfect monitoring (Q1684128) (← links)
• A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
• Blackwell's comparison of experiments and discounted repeated games (Q2273941) (← links)
• Server-aided private set intersection based on reputation (Q2293036) (← links)
• Utility dependence in correct and fair rational secret sharing (Q2429715) (← links)
• A game-theoretic security framework for quantum cryptography: performance analysis and application (Q2684305) (← links)
• One-time rational secret sharing scheme based on bayesian game (Q2887507) (← links)
• When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
• Rationality in the Full-Information Model (Q3408207) (← links)
• Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← links)
• A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer (Q3460103) (← links)
• Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies (Q5009424) (← links)
• Bayesian mechanism for rational secret sharing scheme (Q5046467) (← links)
• (Q5393518) (← links)
• Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
• Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
• \(\log^\ast\)-round game-theoretically-fair leader election (Q6108988) (← links)
• On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC (Q6581796) (← links)