On the Feasibility of Extending Oblivious Transfer

DOI10.1007/978-3-642-36594-2_29zbMath1315.94086OpenAlexW2097241528MaRDI QIDQ4910296

Hila Zarosim, Yehuda Lindell

Publication date: 18 March 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_29

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (6)

Information-theoretic broadcast with dishonest majority for long messages ⋮ Efficient Secure Multiparty Computation with Identifiable Abort ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ More efficient oblivious transfer extensions ⋮ Efficient constant-round MPC with identifiable abort and public verifiability ⋮ Oblivious transfer based on single-qubit rotations

This page was built for publication: On the Feasibility of Extending Oblivious Transfer