Efficient Oblivious Transfer from Lossy Threshold Homomorphic Encryption
In this article, a new oblivious transfer (OT) protocol, secure in the presence of erasure-free one-sided active adaptive adversaries is presented. The new bit OT protocol achieves better communication complexity than the existing bit OT protocol in this setting. The new bit OT protocol requires fewer number of public key encryption operations than the existing bit OT protocol in this setting. As a building block, a new two-party lossy threshold homomorphic public key cryptosystem is designed. It is secure in the same adversary model. It is of independent interest.
KeywordsOblivious transfer Active adversary One-sided adaptive adversary Threshold encryption Lossy encryption Public key encryption Homomorphic encryption
- 4.Bellare, M., Yilek, S.: Encryption schemes secure under selective opening attack. Cryptology ePrint Archive, Report 2009/101 (2009). http://eprint.iacr.org/
- 8.Damgård, I.: On \(\Sigma \)-protocols. www.cs.au.dk/~ivan/Sigma.pdf
- 16.Nargis, I.: Efficient oblivious transfer from lossy threshold homomorphic encryption. Cryptology ePrint Archive, Report 2017/235 (2017). http://eprint.iacr.org/2017/235
- 17.Nielsen, J.B.: On protocol security in the cryptographic model. Ph.D. thesis, University of Aarhus (2004)Google Scholar