The following pages link to Theory of Cryptography (Q5901773):
Displaying 22 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Secure computation without authentication (Q656923) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
- Computational hardness of optimal fair computation: beyond Minicrypt (Q2128555) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- Concurrent composition of secure protocols in the timing model (Q2463448) (← links)
- Non-black-box simulation from one-way functions and applications to resettable security (Q2802147) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- Two-Message, Oblivious Evaluation of Cryptographic Functionalities (Q2829963) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model (Q3392944) (← links)
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model (Q3408213) (← links)
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge (Q3408214) (← links)
- Protocols for bounded-concurrent secure two-party computation in the plain model (Q3594441) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
