Best of both worlds. Revisiting the spymasters double agent problem

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

Oxana Poburinnaya, Anasuya Acharya, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam

Publication date: 2 February 2024

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

zbMATH Keywords

best of both worldsMPC protocols compilerMPC with fall-back security

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The price of active security in cryptographic protocols
• On statistical security in two-party computation
• Multiparty Computation from Somewhat Homomorphic Encryption
• On Achieving the “Best of Both Worlds” in Secure Multiparty Computation
• How to share a secret
• Founding Cryptography on Oblivious Transfer – Efficiently
• Black-Box Constructions of Two-Party Protocols from One-Way Functions
• Advances in Cryptology – CRYPTO 2004
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• The Exact Round Complexity of Secure Computation
• Statistical security in two-party computation revisited

This page was built for publication: Best of both worlds. Revisiting the spymasters double agent problem