On secure two-party computation in three rounds

DOI10.1007/978-3-319-70500-2_21zbMath1410.94040OpenAlexW2766230706MaRDI QIDQ1690210

Abhishek Jain, Prabhanjan V. Ananth

Publication date: 19 January 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70500-2_21

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Statistically sender-private OT from LPN and derandomization ⋮ Individual simulations ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier

This page was built for publication: On secure two-party computation in three rounds