Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
From MaRDI portal
Publication:3600224
DOI10.1007/978-3-540-85174-5_15zbMath1183.68086OpenAlexW2122403427MaRDI QIDQ3600224
Mike Rosulek, Manoj Prabhakaran
Publication date: 10 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_15
Related Items (14)
Computational hardness of optimal fair computation: beyond Minicrypt ⋮ On the structure of unconditional UC hybrid protocols ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Reconciling non-malleability with homomorphic encryption ⋮ Chosen ciphertext secure keyed two-level homomorphic encryption ⋮ Achievable \textsf{CCA2} relaxation for homomorphic encryption ⋮ Traceable receipt-free encryption ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ Revisiting (R)CCA security and replay protection ⋮ The Limits of Common Coins: Further Results ⋮ On the Necessary and Sufficient Assumptions for UC Computation
This page was built for publication: Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
