Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
From MaRDI portal
Recommendations
- On the communication complexity of secure computation
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Universally composable two-party and multi-party secure computation
- Round-optimal secure multi-party computation
- On the limitations of universally composable two-party computation without set-up assumptions
Cited in
(17)- Computational hardness of optimal fair computation: beyond Minicrypt
- On the structure of unconditional UC hybrid protocols
- The complexity of multiparty PSM protocols and related models
- The limits of common coins: further results
- Advances in Cryptology - EUROCRYPT 2004
- Categorical composable cryptography: extended version
- Categorical composable cryptography
- Revisiting (R)CCA security and replay protection
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- On the necessary and sufficient assumptions for UC computation
- Complexity of Multi-party Computation Problems: The Case of 2-Party Symmetric Secure Function Evaluation
- Reconciling non-malleability with homomorphic encryption
- Concurrently composable security with shielded super-polynomial simulators
- Chosen ciphertext secure keyed two-level homomorphic encryption
- Traceable receipt-free encryption
- Achievable \textsf{CCA2} relaxation for homomorphic encryption
- Brief announcement: On secure m-party computation, commuting permutation systems and unassisted non-interactive MPC
This page was built for publication: Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600224)
