Black-box constructions of bounded-concurrent secure computation
From MaRDI portal
Publication:2106632
DOI10.1007/978-3-030-57990-6_5zbMATH Open1506.94043OpenAlexW3013856896MaRDI QIDQ2106632FDOQ2106632
Authors: Sanjam Garg, Xiao Liang, Omkant Pandey, Ivan Visconti 
Publication date: 16 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-57990-6_5
Recommendations
- Black-box constructions of composable protocols without set-up
- A new approach to black-box concurrent secure computation
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Black-box constructions for secure computation
- Bounded-concurrent secure two-party computation without setup assumptions
Cited In (16)
- Black-box constructions of protocols for secure computation
- On black-box complexity of universally composable security in the CRS model
- Title not available (Why is that?)
- Black-box constructions for secure computation
- On Black-Box Complexity of Universally Composable Security in the CRS Model
- Towards a unified approach to black-box constructions of zero-knowledge proofs
- Black-box constructions of composable protocols without set-up
- A new approach to black-box concurrent secure computation
- Secure multiparty computation in the bounded storage model
- Bounded-concurrent secure multi-party computation with a dishonest majority
- Bounded-concurrent secure two-party computation without setup assumptions
- Protocols for bounded-concurrent secure two-party computation in the plain model
- Bounds on the efficiency of black-box commitment schemes
- On concurrent multi-party quantum computation
- Concurrent secure computation via non-black box simulation
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
This page was built for publication: Black-box constructions of bounded-concurrent secure computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2106632)
