Pages that link to "Item:Q2795971"
From MaRDI portal
The following pages link to On Black-Box Complexity of Universally Composable Security in the CRS Model (Q2795971):
Displaying 8 items.
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← 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)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
