Pages that link to "Item:Q5261632"
From MaRDI portal
The following pages link to Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma (Q5261632):
Displaying 9 items.
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← 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)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
