Founding Cryptography on Oblivious Transfer

By R. Ahlswede. 2016

355 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/aab2764de08142e8c256f6014d0cd1ff600517ad

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Computer Vision and Pattern Recognition

In Electrical and Electronic Engineering

Citations in the corpus

A Pragmatic Introduction to Secure Multi-Party Computation (2019, background): “n: ti, t00 j , t 01 j , t 10 j , t 11 j 2 {0, 1}k for some k. It is convenient to consider the columns of blocks, spanning across the shares. Every column (with the exception of the j-th) consists of four equal blocks, where the value j is private. For simplicity, we show the main ideas by consideri”
How to Use Bitcoin to Design Fair Protocols (2014, background): “Since FOT, the ideal functionality for oblivious transfer, is sufficient [64, 66] to compute any standard ideal functionality (and further implies one-way functions), we have the following theorem:”
Efficient Pseudorandom Correlation Generators: Silent OT Extension and More (2019, background): “The OT correlation can serve as a basis for general MPC protocols with no honest majority [40, 54, 49].”
Theory of Cryptography (2014, background): “It was later shown that in fact, a weaker primitive called tag-based encryption suffices [45].”
SoK: General Purpose Compilers for Secure Multi-Party Computation (2019, background): “From a theoretical standpoint, MPC protocols can be built from OT alone [91], [80], but the key feature that makes OT suitable for building efficient MPC protocols is that OT is equivalent to a seemingly weaker functionality called Random OT (ROT) [43], where the choice bit b is not provided as an i”
Privacy and Data Protection by Design - from policy to engineering (2014, background): “In [132] it was shown that oblivious transfer is complete for MPC: that is, given an implementation of oblivious transfer, it is possible to securely evaluate any polynomial-time computable function without any additional primitive.”
Efficient Batched Oblivious PRF with Applications to Private Set Intersection (2016, background): “In fact, OT is both necessary and sufficient for secure computation [15].”
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries (2007, methodology): “These two reductions are comparable to Kilian’s reduction, which uses OT alone but incurs a number of rounds which is linear in the depth of the circuit [18].”