Founding Cryptography on Oblivious Transfer - Efficiently

By Yuval Ishai, Manoj M. Prabhakaran, Amit Sahai. Annual International Cryptology Conference, 2008

564 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/19de1229db1c2e62367a3d1459e24848064dfd02

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 Computational Theory and Mathematics

In Geometry and Topology

Citations in the corpus

Quantum Cryptography (2006, unknown): “OT is interesting since it is conceptually simple, yet it is very strong: one can show that OT is complete for secure 2PC, meaning that in principle one can implement any secure 2PC when given an OT [37, 38].”
Multiparty Computation from Somewhat Homomorphic Encryption (2012, background): “[18, 17] has similar overall asymptotic complexity, but larger constants and a less efficient online phase.”
Billion-Gate Secure Computation with Malicious Adversaries (2012, result): “Our results are in the standard model (i.e., no common reference strings or PKIs) and, in contrast to prior work, we do not use the random oracle model which has well-established theoretical shortcomings.”
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”
Zero-knowledge from secure multiparty computation (2007, unknown): “Evidence in this direction was recently given in [28, 33].”
Theory of Cryptography (2014, methodology): “Also relevant to our work are different variants of non-black-box simulation used in the literature [7,9,62,63,22] as well as efficient and universal arguments [46,52,10,43].”
How to Use Bitcoin to Design Fair Protocols (2014, background): “[64] Yuval Ishai, Manoj Prabhakaran, and Amit Sahai.”
Fast Cut-and-Choose-Based Protocols for Malicious and Covert Adversaries (2013, result): “Our protocol achieves covert security with deterrent = 1 − 2 − s +1 (i.e., the error is 2 − s +1 ) which is far more eﬃcient than all previous work.”
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup (2017, methodology): “More concretely, we instantiate the MPC component with an optimized variant of the protocol of Damgård and Ishai [16] (similar to the one described in Appendix C of [33]) and transform it into a ZKIPCP by applying a more e cient variant of the IKOS transformation in the spirit of the IPS compiler [3”
Efficient Constant-Round Multi-party Computation Combining BMR and SPDZ (2019, methodology): “Our estimates show the protocol to be considerably more efficient than previous fully-secure multi-party protocols.”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, background): “A black-box approach for transforming a semi-honest-secure protocol into a malicious-secure one (Ishai et al., 2007; Ishai et al., 2008) is known as “MPC in the head.”
Secure Two-Party Computation is Practical (2009, methodology): “The correlation robustness assumption has been recently used in the context of oblivious transfer [14, 17] and in the context of secure computation [19, 26].”
Machine Learning Classification over Encrypted Data (2015, background): “Secure two-party computation protocols for generic functions exist in theory [4], [5], [22], [23], [24] and in practice [6], [7], [8].”