Pages that link to "Item:Q5445513"
From MaRDI portal
The following pages link to Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513):
Displaying 24 items.
- An optimally fair coin toss (Q315542) (← links)
- Toward a game theoretic view of secure computation (Q321318) (← links)
- Unmediated communication with partially verifiable types (Q533921) (← links)
- Game theoretic notions of fairness in multi-party coin toss (Q1629437) (← links)
- Establishing rational networking using the DL04 quantum secure direct communication protocol (Q1993768) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- Utility dependence in correct and fair rational secret sharing (Q2429715) (← links)
- Secure message transmission on directed networks (Q2442837) (← links)
- The meeting businessmen problem: requirements and limitations (Q2443007) (← links)
- A game-theoretic security framework for quantum cryptography: performance analysis and application (Q2684305) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- One-time rational secret sharing scheme based on bayesian game (Q2887507) (← links)
- When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
- Realistic versus Rational Secret Sharing (Q3297660) (← 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)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening (Q3627426) (← links)
- Bayesian mechanism for rational secret sharing scheme (Q5046467) (← links)
- Cryptography and Game Theory: Designing Protocols for Exchanging Information (Q5445513) (← 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)