Equilibrium concepts for rational multiparty computation

DOI10.1007/978-3-319-02786-9_14MaRDI QIDQ3190046zbMATH OpenOpenAlexFDO

Authors John Ross Wallrabenstein, Chris Clifton

Publication date 15 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-02786-9_14

zbMATH Keywords

perfect Bayesian equilibriumrational secret sharingnon-cooperative computationrational multiparty computation

Mathematics Subject Classification ID

Applications of game theory (91A80) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Toward a game theoretic view of secure computation
• Towards a game theoretic view of secure computation
• Distributed computing meets game theory
• Fair computation with rational players
• Cryptography and Game Theory: Designing Protocols for Exchanging Information

Cited in

(5)

• On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
• Distributed computing meets game theory
• Enforcing input correctness via certification in garbled circuit evaluation
• Improved signature schemes for secure multi-party computation with certified inputs
• Computing Equilibria with Partial Commitment

This page was built for publication: Equilibrium concepts for rational multiparty computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3190046)