Pages that link to "Item:Q2425531"
From MaRDI portal
The following pages link to Lower bounds and impossibility results for concurrent self composition (Q2425531):
Displaying 11 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Concurrent Secure Computation via Non-Black Box Simulation (Q3457058) (← links)
- Protocols for bounded-concurrent secure two-party computation in the plain model (Q3594441) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980) (← links)
- Theory of Cryptography (Q5901773) (← links)
- Practical round-optimal blind signatures in the ROM from standard assumptions (Q6562573) (← links)
- Pairing-free blind signatures from standard assumptions in the ROM (Q6648193) (← links)
- MPC for tech giants (GMPC): enabling Gulliver and the Lilliputians to cooperate amicably (Q6653024) (← links)
