The Exact Round Complexity of Secure Computation
From MaRDI portal
Publication:5739211
DOI10.1007/978-3-662-49896-5_16zbMath1371.94637OpenAlexW2495293033MaRDI QIDQ5739211
Antigoni Polychroniadou, Pratyay Mukherjee, Omkant Pandey, Sanjam Garg
Publication date: 15 July 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49896-5_16
Related Items (31)
On the round complexity of secure quantum computation ⋮ On the round complexity of black-box secure MPC ⋮ Round optimal black-box ``commit-and-prove ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ More Efficient Constant-Round Multi-party Computation from BMR and SHE ⋮ Round-optimal and communication-efficient multiparty computation ⋮ Round-optimal multi-party computation with identifiable abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ From FE combiners to secure MPC and back ⋮ Maliciously-secure MrNISC in the plain model ⋮ Statistical security in two-party computation revisited ⋮ Round-optimal black-box secure computation from two-round malicious OT ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Best of both worlds. Revisiting the spymasters double agent problem ⋮ Round-optimal black-box MPC in the plain model ⋮ Reusable secure computation in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ On the exact round complexity of best-of-both-worlds multi-party computation ⋮ Blockchains enable non-interactive MPC ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ What security can we achieve within 4 rounds? ⋮ On the exact round complexity of secure three-party computation ⋮ Round-optimal secure multi-party computation ⋮ On the enumeration of minimal non-pairwise compatibility graphs ⋮ Post-quantum multi-party computation ⋮ The Feasibility of Outsourced Database Search in the Plain Model ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Succinct non-interactive secure computation
This page was built for publication: The Exact Round Complexity of Secure Computation
