Round-Optimal Secure Two-Party Computation from Trapdoor Permutations

@inproceedings{Ciampi2017RoundOptimalST,
  title={Round-Optimal Secure Two-Party Computation from Trapdoor Permutations},
  author={Michele Ciampi and Rafail Ostrovsky and Luisa Siniscalchi and Ivan Visconti},
  booktitle={TCC},
  year={2017}
}
In this work we continue the study on the round complexity of secure two-party computation with black-box simulation. Katz and Ostrovsky in CRYPTO 2004 showed a 5 (optimal) round construction assuming trapdoor permutations for the general case where both players receive the output. They also proved that their result is round optimal. This lower bound has been recently revisited by Garg et al. in Eurocrypt 2016 where a 4 (optimal) round protocol is showed assuming a simultaneous message exchange… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 11 CITATIONS

Efficient Zero-Knowledge for NP from Secure Two-Party Computation

  • IACR Cryptology ePrint Archive
  • 2019
VIEW 2 EXCERPTS
CITES BACKGROUND

Similar Papers

Loading similar papers…