A Java library for the OT protocols I programmed during my PhD.

We use GitHub packages.

Using this library is straight-forward.
The oblivioustransfer4j package contains several sub-packages, e.g. ot. Check their interfaces to understand how everything is implemented.

• [ALSZ13] Optimized n x OT_l protocol.
  Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. 2013. More efficient oblivious transfer and extensions for faster secure computation. In Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (CCS '13). Association for Computing Machinery, New York, NY, USA, 535–548. https://doi.org/10.1145/2508859.2516738

• [ALSZ13] Optimized n x OTe_l protocol.
  Gilad Asharov, Yehuda Lindell, Thomas Schneider, and Michael Zohner. 2013. More efficient oblivious transfer and extensions for faster secure computation. In Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security (CCS '13). Association for Computing Machinery, New York, NY, USA, 535–548. https://doi.org/10.1145/2508859.2516738

• [BEA95] Precomputed n x OT_l protocol.
  Beaver, D. (1995). Precomputing Oblivious Transfer. In: Coppersmith, D. (eds) Advances in Cryptology — CRYPT0’ 95. CRYPTO 1995. Lecture Notes in Computer Science, vol 963. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44750-4_8

• [ASHAROV17] Receiver-random n x OT_l protocol.
  Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2016). More Efficient Oblivious Transfer Extensions. Journal of Cryptology, 30, 805 - 858.

• [ASHAROV17] Sender-random n x OT_l protocol.
  Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2016). More Efficient Oblivious Transfer Extensions. Journal of Cryptology, 30, 805 - 858.

• [ASHAROV17] Random n x OT_l protocol.
  Asharov, G., Lindell, Y., Schneider, T., & Zohner, M. (2016). More Efficient Oblivious Transfer Extensions. Journal of Cryptology, 30, 805 - 858.

Found a bug, problem, ... or do you have a question about this library?
Do not hesitate to contact me as soon as possible!