Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
From MaRDI portal
Publication:5261632
DOI10.1007/978-3-662-46494-6_12zbMATH Open1354.94030OpenAlexW23650548MaRDI QIDQ5261632FDOQ5261632
Authors: Vipul Goyal, Huijia Lin, Omkant Pandey, Rafael Pass, Amit Sahai 
Publication date: 6 July 2015
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46494-6_12
Recommendations
- Adaptively secure, universally composable, multiparty computation in constant rounds
- Concurrently secure computation in constant rounds
- The Exact Round Complexity of Secure Computation
- Round-optimal secure multi-party computation
- Round-optimal secure multi-party computation
- The round complexity of secure computation against covert adversaries
- Concurrently composable non-interactive secure computation
- A new approach to round-optimal secure multiparty computation
- Round-efficient black-box construction of composable multi-party computation
- Round-efficient black-box construction of composable multi-party computation
Cited In (14)
- Composable long-term security with rewinding
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments
- Concurrently secure computation in constant rounds
- Two-round concurrent 2PC from sub-exponential LWE
- Magic Adversaries Versus Individual Reduction: Science Wins Either Way
- Concurrently Composable Security with Shielded Super-Polynomial Simulators
- Concurrently composable non-interactive secure computation
- Adaptive hardness and composable security in the plain model from standard assumptions
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- On the Exact Round Complexity of Self-composable Two-Party Computation
- Statistical concurrent non-malleable zero-knowledge from one-way functions
- Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Round-efficient black-box construction of composable multi-party computation
This page was built for publication: Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261632)
