Pages that link to "Item:Q2874546"
From MaRDI portal
The following pages link to Round-Efficient Black-Box Construction of Composable Multi-Party Computation (Q2874546):
Displaying 15 items.
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← 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)
- Towards a unified approach to black-box constructions of zero-knowledge proofs (Q2139627) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- Survey of information security (Q2385398) (← links)
- Improved, black-box, non-malleable encryption from semantic security (Q2413015) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← 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)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
