The following pages link to (Q4434869):
Displaying 18 items.
- Long-term security and universal composability (Q604632) (← links)
- Secure computation without authentication (Q656923) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Initiator-Resilient Universally Composable Key Exchange (Q5030209) (← links)
- Isolated Proofs of Knowledge and Isolated Zero Knowledge (Q5458611) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Verifiable relation sharing and multi-verifier zero-knowledge in two rounds: trading NIZKs with honest majority (extended abstract) (Q6111540) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
