What is the most efficient 1-out-of-N Oblivious Transfer construction described in current literature? I have been studying Oblivious Transfer for my bachelor's thesis and have been surprised at the number of variations of OT.
From what I've read so far, the constructions proposed by Naor and Pinkas in &quot;Efficient Oblivious Transfer Protocols&quot; and &quot;Oblivious Transfer and Polynomial Evaluation&quot;, as well as Tung Chou and Claudio Orlandi's construction proposed in &quot;The Simplest Protocol for Oblivious Transfer&quot;, but I am not sure.
I will continue to research this topic and any feedback is appreciated.
It depends if you want many instances (like 1 million) of OT, or just a few.
For a small number of OTs, I would recommend looking at our very recent paper:

McQuoid, Rosulek, Roy: Minimal Symmetric PAKE and 1-out-of-N OT from Programmable-Once Public Functions, CCS 2020.

We're not aware of other protocols whose communication is independent of $N$.
For a large number of OTs, you would use some kind of OT extension approach. The leading OT extension protocol for 1-out-of-N is:

Orrù, Orsini, Scholl: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection, CT-RSA 2017.