When is a semi-honest secure multiparty computation valuable?

DOI10.1007/978-3-030-32430-8_4MaRDI QIDQ3297650zbMATH OpenOpenAlexFDO

Authors Radhika Bhargava, Chris Clifton

Publication date 20 July 2020

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

Full work available at URL https://doi.org/10.1007/978-3-030-32430-8_4

zbMATH Keywords

incentive compatibilitymalicious and semi-honest modelssecure multiparty computation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation
• scientific article; zbMATH DE number 1952886
• Secure multi-party computation made simple
• On achieving the ``best of both worlds in secure multiparty computation
• Secure computation with honest-looking parties: what if nobody is truly honest? (extended abstract)

Cites work

• A group incentive compatible mechanism yielding core allocations
• Bridging Game Theory and Cryptography: Recent Results and Future Directions
• Confidentiality and information sharing in supply chain coordination
• Cryptography and Game Theory: Designing Protocols for Exchanging Information
• Distributed computing meets game theory
• Fair computation with rational players
• Game theory in supply chain analysis
• How to simulate it -- a tutorial on the simulation proof technique
• scientific article; zbMATH DE number 1975133 (Why is no real title available?)
• scientific article; zbMATH DE number 1759774 (Why is no real title available?)
• Non-cooperative computation: Boolean functions with correctness and exclusivity
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Rational secret sharing and multiparty computation
• Rational Secret Sharing, Revisited
• Rationality and Adversarial Behavior in Multi-party Computation
• Secure multiparty computation goes live
• The Implementation of Social Choice Rules: Some General Results on Incentive Compatibility
• The middleman as a panacea for supply chain coordination problems
• The quantity flexibility contract and supplier-customer incentives
• Universally composable two-party and multi-party secure computation
• Verifiably Secure Devices
• Zero-knowledge proofs of identity

This page was built for publication: When is a semi-honest secure multiparty computation valuable?

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