Pages that link to "Item:Q1407493"
From MaRDI portal
The following pages link to Composition of secure multi-party protocols. A comprehensive study. (Q1407493):
Displayed 13 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Long-term security and universal composability (Q604632) (← 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)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Polynomial runtime and composability (Q2392095) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- Secure Two-Party Computation of Squared Euclidean Distances in the Presence of Malicious Adversaries (Q3600327) (← links)
- Cryptography Using Captcha Puzzles (Q4916003) (← links)
- Conditional Reactive Simulatability (Q5862529) (← links)
- Actively secure arithmetic computation and VOLE with constant computational overhead (Q6061358) (← links)