Pages that link to "Item:Q3580953"

The following pages link to Rational secret sharing and multiparty computation (Q3580953):

Displaying 34 items.

• An optimally fair coin toss (Q315542) (← links)
• Toward a game theoretic view of secure computation (Q321318) (← links)
• A rational framework for secure communication (Q497644) (← links)
• Unmediated communication with partially verifiable types (Q533921) (← links)
• Verification of multi-agent systems with public actions against strategy logic (Q785241) (← links)
• Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
• Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← 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)
• Rational protocol of quantum secure multi-party computation (Q1993846) (← links)
• Game theoretic security of quantum bit commitment (Q2004756) (← links)
• Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
• Fair hierarchical secret sharing scheme based on smart contract (Q2055532) (← links)
• Enforcing input correctness via certification in garbled circuit evaluation (Q2167732) (← links)
• Improved signature schemes for secure multi-party computation with certified inputs (Q2167761) (← links)
• A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification (Q2232597) (← links)
• Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem (Q2274088) (← links)
• Threshold changeable secret sharing with secure secret reconstruction (Q2296281) (← links)
• A rational threshold signature model and protocol based on different permissions (Q2336193) (← links)
• Scalable mechanisms for rational secret sharing (Q2355325) (← links)
• Utility dependence in correct and fair rational secret sharing (Q2429715) (← links)
• Secure message transmission on directed networks (Q2442837) (← links)
• Fair quantum secret sharing based on symmetric bivariate polynomial (Q2669297) (← links)
• A game-theoretic security framework for quantum cryptography: performance analysis and application (Q2684305) (← links)
• Rational quantum secret sharing scheme based on GHZ state (Q2693837) (← 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)
• Perfectly Secure Message Transmission Against Independent Rational Adversaries (Q3297684) (← links)
• Efficient Rational Secret Sharing in Standard Communication Networks (Q3408208) (← 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)