Pages that link to "Item:Q5746344"
From MaRDI portal
The following pages link to Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol (Q5746344):
Displayed 15 items.
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- A black-box construction of non-malleable encryption from semantically secure encryption (Q1747662) (← links)
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- Improved, black-box, non-malleable encryption from semantic security (Q2413015) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions (Q3457061) (← links)
- Round-Optimal Black-Box Two-Party Computation (Q3457073) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Maliciously-secure MrNISC in the plain model (Q6061354) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)