Pages that link to "Item:Q3003396"
From MaRDI portal
The following pages link to Towards a Game Theoretic View of Secure Computation (Q3003396):
Displaying 19 items.
- Extending concurrent signature to multiple parties (Q401477) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Quantum secure two-party computation for set intersection with rational players (Q1993844) (← links)
- Game theoretic security of quantum bit commitment (Q2004756) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Leakage and protocol composition in a game-theoretic perspective (Q2324199) (← links)
- Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer (Q3460103) (← links)
- (Q4788579) (← links)
- A Calculus for Game-Based Security Proofs (Q4933210) (← links)
- Distributed computing meets game theory (Q5177264) (← links)
- Economically Optimal Variable Tag Length Message Authentication (Q5854434) (← 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)
- Bit security as computational cost for winning games with high probability (Q6157548) (← links)
- Game-Theoretic Analysis of an Incentivized Verifiable Computation System (Q6166529) (← links)
- The parallel reversible pebbling game: analyzing the post-quantum security of iMHFs (Q6169348) (← links)
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC (Q6581796) (← links)
