Paper 2016/940
Fast Actively Secure OT Extension for Short Secrets
Arpita Patra, Pratik Sarkar, and Ajith Suresh
Abstract
Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems of interest such as private set intersection (PSI), private information retrieval (PIR), contract signing to name a few. Often the instantiations of OT require prohibitive communication and computation complexity. OT extension protocols are introduced to compute a very large number of OTs referred as extended OTs at the cost of a small number of OTs referred as seed OTs.
We present a fast OT extension protocol for small secrets in active setting. Our protocol when used to produce
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. The Network and Distributed System Security Symposium (NDSS) 2017
- Contact author(s)
- arpitapatra10 @ gmail com
- History
- 2016-10-29: revised
- 2016-09-29: received
- See all versions
- Short URL
- https://ia.cr/2016/940
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/940, author = {Arpita Patra and Pratik Sarkar and Ajith Suresh}, title = {Fast Actively Secure {OT} Extension for Short Secrets}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/940}, year = {2016}, url = {https://eprint.iacr.org/2016/940} }