One-Sided Adaptively Secure Two-Party Computation

DOI10.1007/978-3-642-54242-8_16zbMath1326.94098OpenAlexW1794552368MaRDI QIDQ5746345

Arpita Patra, Carmit Hazay

Publication date: 18 February 2014

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54242-8_16

zbMATH Keywords

oblivious transfernon-committing encryptionadaptively secure computation

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (4)

Efficient one-sided adaptively secure computation ⋮ Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption ⋮ On Adaptively Secure Multiparty Computation with a Short CRS ⋮ On black-box complexity of universally composable security in the CRS model

This page was built for publication: One-Sided Adaptively Secure Two-Party Computation