More efficient oblivious transfer extensions with security for malicious adversaries
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is
widely used in protocols for secure two-party and multi-party computation. As secure
computation becomes more practical, the need for practical large scale oblivious transfer
protocols is becoming more evident. Oblivious transfer extensions are protocols that enable
a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs
at low cost. In the semi-honest setting, Ishai et al.(CRYPTO 2003) presented an OT …
widely used in protocols for secure two-party and multi-party computation. As secure
computation becomes more practical, the need for practical large scale oblivious transfer
protocols is becoming more evident. Oblivious transfer extensions are protocols that enable
a relatively small number of “base-OTs” to be utilized to compute a very large number of OTs
at low cost. In the semi-honest setting, Ishai et al.(CRYPTO 2003) presented an OT …
More efficient oblivious transfer extensions
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is
widely used in protocols for secure two-party and multi-party computation. As secure
computation becomes more practical, the need for practical large-scale OT protocols is
becoming more evident. OT extensions are protocols that enable a relatively small number
of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-
honest setting, Ishai et al.(Advances in cryptology—CRYPTO'03, vol 2729 of LNCS …
widely used in protocols for secure two-party and multi-party computation. As secure
computation becomes more practical, the need for practical large-scale OT protocols is
becoming more evident. OT extensions are protocols that enable a relatively small number
of “base-OTs” to be utilized to compute a very large number of OTs at low cost. In the semi-
honest setting, Ishai et al.(Advances in cryptology—CRYPTO'03, vol 2729 of LNCS …
Showing the best results for this search. See all results