Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation

DOI10.1007/978-3-642-00457-5_16zbMath1213.94122OpenAlexW1486265451MaRDI QIDQ3611770

Mike Rosulek, Manoj Prabhakaran, Hemanta K. Maji

Publication date: 3 March 2009

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00457-5_16

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Related Items (9)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the structure of unconditional UC hybrid protocols ⋮ Secure Computation from Leaky Correlated Randomness ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Completeness for symmetric two-party functionalities: revisited ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ The Limits of Common Coins: Further Results ⋮ On Complete Primitives for Fairness ⋮ On the Necessary and Sufficient Assumptions for UC Computation

This page was built for publication: Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation