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 13 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)
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round (Q6108994) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Composable long-term security with rewinding (Q6587965) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
