Rational secret sharing and multiparty computation
From MaRDI portal
Publication:3580953
DOI10.1145/1007352.1007447zbMath1192.94119OpenAlexW2168325212MaRDI QIDQ3580953
Joseph Y. Halpern, Vanessa Teague
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007447
game theorysecret sharingmultiparty computationiterated deletion of weakly dominated strategiesnon-cooperative computing
Applications of game theory (91A80) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62)
Related Items (36)
One-time rational secret sharing scheme based on bayesian game ⋮ Incentive-driven attacker for corrupting two-party protocols ⋮ Game theoretic notions of fairness in multi-party coin toss ⋮ An optimally fair coin toss ⋮ Toward a game theoretic view of secure computation ⋮ Enforcing input correctness via certification in garbled circuit evaluation ⋮ Improved signature schemes for secure multi-party computation with certified inputs ⋮ A complete characterization of game-theoretically fair, multi-party coin toss ⋮ Fair quantum secret sharing based on symmetric bivariate polynomial ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ \(\log^\ast\)-round game-theoretically-fair leader election ⋮ A game-theoretic security framework for quantum cryptography: performance analysis and application ⋮ Data curation from privacy-aware agents ⋮ Utility dependence in correct and fair rational secret sharing ⋮ Rational quantum secret sharing scheme based on GHZ state ⋮ Secure message transmission on directed networks ⋮ Protocol completion incentive problems in cryptographic Vickrey auctions ⋮ When Is a Semi-honest Secure Multiparty Computation Valuable? ⋮ Realistic versus Rational Secret Sharing ⋮ Perfectly Secure Message Transmission Against Independent Rational Adversaries ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ A rational framework for secure communication ⋮ Establishing rational networking using the DL04 quantum secure direct communication protocol ⋮ Rational protocol of quantum secure multi-party computation ⋮ Unmediated communication with partially verifiable types ⋮ Game theoretic security of quantum bit commitment ⋮ Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem ⋮ Cryptography and Game Theory: Designing Protocols for Exchanging Information ⋮ Round-preserving parallel composition of probabilistic-termination cryptographic protocols ⋮ Threshold changeable secret sharing with secure secret reconstruction ⋮ Fair hierarchical secret sharing scheme based on smart contract ⋮ Efficient Rational Secret Sharing in Standard Communication Networks ⋮ Verification of multi-agent systems with public actions against strategy logic ⋮ A rational threshold signature model and protocol based on different permissions ⋮ Economically Optimal Variable Tag Length Message Authentication ⋮ Scalable mechanisms for rational secret sharing
This page was built for publication: Rational secret sharing and multiparty computation
