Concurrently Secure Computation in Constant Rounds
From MaRDI portal
Publication:2894403
DOI10.1007/978-3-642-29011-4_8zbMath1297.94069OpenAlexW1846756762MaRDI QIDQ2894403
Abhishek Jain, Amit Sahai, Sanjam Garg, Vipul Goyal
Publication date: 29 June 2012
Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_8
Related Items (14)
One-message zero knowledge and non-malleable commitments ⋮ Concurrent Secure Computation via Non-Black Box Simulation ⋮ Concurrent Secure Computation with Optimal Query Complexity ⋮ Maliciously-secure MrNISC in the plain model ⋮ Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Concurrently composable non-interactive secure computation ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ Magic Adversaries Versus Individual Reduction: Science Wins Either Way ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions
This page was built for publication: Concurrently Secure Computation in Constant Rounds
