Completeness for Symmetric Two-Party Functionalities - Revisited

DOI10.1007/978-3-642-34961-4_9zbMath1292.94102OpenAlexW1554241476MaRDI QIDQ4911581

Hila Zarosim, Eran Omri, Yehuda Lindell

Publication date: 19 March 2013

Published in: Advances in Cryptology – ASIACRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-34961-4_9

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Computational hardness of optimal fair computation: beyond Minicrypt ⋮ Completeness for symmetric two-party functionalities: revisited

This page was built for publication: Completeness for Symmetric Two-Party Functionalities - Revisited