More efficient oblivious transfer and extensions for faster secure computation
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
Abstract
Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
Abstract
Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography.
OpenAlex reports 361 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Protocols for secure computation enable parties to compute a joint function on their private inputs without revealing anything but the result. A foundation for secure computation is oblivious transfer (OT), which traditionally requires expensive public key cryptography. A more efficient way to perform many OTs is to extend a small number of base OTs using OT extensions based on symmetric cryptography.
Key concepts: Oblivious transfer, Computer science, Secure multi-party computation, Cryptography, Computation, Theoretical computer science, Public-key cryptography, Key (lock)