Round-optimal secure two-party computation from trapdoor permutations
From MaRDI portal
Publication:1690212
DOI10.1007/978-3-319-70500-2_23zbMath1410.94057OpenAlexW2765621996MaRDI QIDQ1690212
Luisa Siniscalchi, Rafail Ostrovsky, Ivan Visconti, Michele Ciampi
Publication date: 19 January 2018
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/57155256/Round_Optimal_Secure_Two_Party_Computation_from_Trapdoor_Permutations.pdf
Related Items (11)
On the round complexity of secure quantum computation ⋮ 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 ⋮ Maliciously-secure MrNISC in the plain model ⋮ Statistical security in two-party computation revisited ⋮ Four-round black-box non-malleable schemes from one-way permutations ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Oblivious transfer from trapdoor permutations in minimal rounds ⋮ What security can we achieve within 4 rounds? ⋮ Round-optimal secure multi-party computation
This page was built for publication: Round-optimal secure two-party computation from trapdoor permutations
