Realizable Rational Multiparty Cryptographic Protocols

DOI10.1007/978-3-319-12601-2_8MaRDI QIDQ2818052zbMATHOpenAlexFDO

Authors John Ross Wallrabenstein, Chris Clifton

Publication date 5 September 2016

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-12601-2_8

zbMATH Keywords

game theorynon-cooperative computationrational multiparty computation

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Recommendations

• Rational secret sharing and multiparty computation
• A rational approach to cryptographic protocols
• Rational protocol of quantum secure multi-party computation
• Theory and Practice of Multiparty Computation
• Security and composition of multiparty cryptographic protocols
• Verifiable computation in multiparty protocols with honest majority
• Realistic Failures in Secure Multi-party Computation
• Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
• Generalizing efficient multiparty computation

Cited in

(2)

• Enforcing input correctness via certification in garbled circuit evaluation
• A rational approach to cryptographic protocols

This page was built for publication: Realizable Rational Multiparty Cryptographic Protocols

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