Pages that link to "Item:Q2867225"
From MaRDI portal
The following pages link to Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments (Q2867225):
Displaying 13 items.
- Committed MPC -- maliciously secure multiparty computation from homomorphic commitments (Q1749303) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Four-round black-box non-malleable schemes from one-way permutations (Q6114274) (← links)
- Fully-secure MPC with minimal trust (Q6114281) (← links)
