Pages that link to "Item:Q2499272"
From MaRDI portal
The following pages link to On the limitations of universally composable two-party computation without set-up assumptions (Q2499272):
Displaying 20 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- On the structure of unconditional UC hybrid protocols (Q1631320) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- A second note on the feasibility of generalized universal composability (Q3130297) (← 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)
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort (Q3540059) (← links)
- Resettably Secure Computation (Q3627427) (← links)
- Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS (Q4916002) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- The Layered Games Framework for Specifications and Analysis of Security Protocols (Q5445502) (← links)
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware (Q5458612) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments (Q5739212) (← links)
- A formal treatment of end-to-end encrypted cloud storage (Q6648201) (← links)
