Best of both worlds. Revisiting the spymasters double agent problem

DOI10.1007/978-3-031-38557-5_11MaRDI QIDQ6186596FDOQ6186596

Authors: Anasuya Acharya, Carmit Hazay, Oxana Poburinnaya, Muthuramakrishnan Venkitasubramaniam 

Publication date: 2 February 2024

Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

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

zbMATH Keywords

best of both worldsMPC protocols compilerMPC with fall-back security

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Theory of compilers and interpreters (68N20)

Cites Work

• How to share a secret
• Multiparty Computation from Somewhat Homomorphic Encryption
• Founding Cryptography on Oblivious Transfer – Efficiently
• Title not available (Why is that?)
• Advances in Cryptology – CRYPTO 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• The Exact Round Complexity of Secure Computation
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• The price of active security in cryptographic protocols
• 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

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)