Best of both worlds. Revisiting the spymasters double agent problem
From MaRDI portal
Publication:6186596
Recommendations
- \(1/p\)-secure multiparty computation without an honest majority and the best of both worlds
- MPC with friends and foes
- \(1/p\)-secure multiparty computation without honest majority and the best of both worlds
- On achieving the ``best of both worlds in secure multiparty computation
- Fully-secure MPC with minimal trust
Cites work
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 5485432 (Why is no real title available?)
- scientific article; zbMATH DE number 4101088 (Why is no real title available?)
- Advances in Cryptology – CRYPTO 2004
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Founding Cryptography on Oblivious Transfer – Efficiently
- How to share a secret
- Multiparty Computation from Somewhat Homomorphic Encryption
- On achieving the ``best of both worlds in secure multiparty computation
- On statistical security in two-party computation
- Statistical security in two-party computation revisited
- The Exact Round Complexity of Secure Computation
- The price of active security in cryptographic protocols
This page was built for publication: Best of both worlds. Revisiting the spymasters double agent problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186596)