A new approach to black-box concurrent secure computation
From MaRDI portal
Publication:1648852
DOI10.1007/978-3-319-78375-8_19zbMATH Open1428.94071OpenAlexW2794736958MaRDI QIDQ1648852FDOQ1648852
Authors: Sanjam Garg, Susumu Kiyoshima, Omkant Pandey 
Publication date: 9 July 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-78375-8_19
Recommendations
- Black-box constructions of bounded-concurrent secure computation
- Black-box constructions of composable protocols without set-up
- Constant-round black-box construction of composable multi-party computation protocol
- Concurrent secure computation via non-black box simulation
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
Cited In (12)
- Title not available (Why is that?)
- Efficient concurrent oblivious transfer in super-polynomial-simulation security
- Black-box constructions of bounded-concurrent secure computation
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Black-Box Constructions of Two-Party Protocols from One-Way Functions
- Concurrently secure computation in constant rounds
- Black-box constructions of composable protocols without set-up
- Concurrently composable non-interactive secure computation
- Concurrently composable security with shielded super-polynomial simulators
- Concurrent secure computation via non-black box simulation
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
This page was built for publication: A new approach to black-box concurrent secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648852)
