Skip to main content

Advertisement

Springer Nature Link
Log in

A generic construction to build simple oblivious transfer protocols from homomorphic encryption schemes

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Oblivious transfer is a fundamental problem in cryptography where it is required that a sender transfers one of potentially many pieces of information to a receiver and at the same time remains oblivious as to which piece has been transferred. There exist many oblivious transfer protocols in the literature; however, most of them lack efficiency needed in practical situations. To fill this gap, we employ the notion of asymmetric homomorphic encryption and propose a generic construction to build simple and efficient oblivious transfer protocols. We then instantiate our construction with some well-known homomorphic encryption schemes such as RSA, Paillier and NTRU to obtain concrete oblivious transfer protocols. We further prove that our generic construction is secure in the universal composable framework.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Asharov G, Lindell Y, Schneider T, Zohner M (2017) More efficient oblivious transfer extensions. J Cryptol 30(3):805–858

    Article  MathSciNet  Google Scholar 

  2. Barreto PS, David B, Dowsley R, Morozov K, Nascimento AC (2017) A framework for efficient adaptively secure composable oblivious transfer in the ROM. arXiv preprint arXiv:1710.08256

  3. Brassard G, Crépeau C, Robert JM (1986) All-or-nothing disclosure of secrets. In: Conference on the Theory and Application of Cryptographic Techniques. Springer, pp 234–238

  4. Chou T, Orlandi C (2015) The simplest protocol for oblivious transfer. In: International Conference on Cryptology and Information Security in Latin America. Springer, pp 40–58

  5. Chou Y, Tsai I, Ko C, Kuo S, Chen I (2006) Quantum Oblivious Transfer and Fair Digital Transactions. In: 2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC’06), pp 121–128

  6. Chu CK, Tzeng WG (2005) Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries. In: International Workshop on Public Key Cryptography. Springer, pp 172–183

  7. Diffie W, Hellman M (1976) New directions in cryptography. IEEE Trans Inform Theory 22(6):644–654

    Article  MathSciNet  Google Scholar 

  8. Döttling N, Garg S, Hajiabadi M, Masny D, Wichs D (2020) Two-round oblivious transfer from CDH or LPN. Adv Cryptol - EUROCRYPT 2020:768–797

    MathSciNet  Google Scholar 

  9. Even S, Goldreich O, Lempel A (1985) A randomized protocol for signing contracts. Commun ACM 28(6):637–647

    Article  MathSciNet  Google Scholar 

  10. Fan CI, Huang SY, Artan W (2013) Design and implementation of privacy preserving billing protocol for smart grid. J Supercomput 66(2):841–862

    Article  Google Scholar 

  11. Garg S, Srinivasan A (2018) Two-round multiparty secure computation from minimal assumptions. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 468–499

  12. Goyal V, Jain A, Jin Z, Malavolta G (2020) Statistical zaps and new oblivious transfer protocols. In: Canteaut A, Ishai Y (eds) Adv Cryptol - EUROCRYPT 2020. Springer International Publishing, Cham, pp 668–699

    Chapter  Google Scholar 

  13. Hauck E, Loss J (2017) Efficient and universally composable protocols for oblivious transfer from the CDH assumption. IACR Cryptol ePrint Archive 2017:1011

    Google Scholar 

  14. Hazay C, Scholl P, Soria-Vazquez E (2020) Low cost constant round MPC combining BMR and oblivious transfer. J Cryptol 33:1732–1786

    Article  MathSciNet  Google Scholar 

  15. Jannati H, Bahrak B (2017) An oblivious transfer protocol based on elgamal encryption for preserving location privacy. Wireless Personal Commun 97(2):3113–3123

    Article  Google Scholar 

  16. Jiang H, Xu Q, Liu C et al. (2018) Cut-and-choose bilateral oblivious transfer protocol based on DDH assumption. J Ambient Intell Human Comput. https://doi.org/10.1007/s12652-018-0713-7

  17. Katz J, Lindell Y (2007) Introd Modern Cryptograp. Chapman and Hall/CRC Press, Florida

    Book  Google Scholar 

  18. Keller M, Orsini E, Scholl P (2016) MASCOT: faster malicious arithmetic secure computation with oblivious transfer. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. ACM, pp 830–842

  19. Kundu N, Debnath SK, Mishra D (2020) 1-out-of-2: post-quantum oblivious transfer protocols based on multivariate public key cryptography. Sādhanā 45(1):1–12

    Article  MathSciNet  Google Scholar 

  20. Lai YF, Galbraith SD, de Saint Guilhem CD (2020) Compact, efficient and UC-secure isogeny-based oblivious transfer. IACR Cryptol ePrint Arch 2020:1012

    MATH  Google Scholar 

  21. Li T, Ren W, Xiang Y, Zheng X, Zhu T, Choo KKR, Srivastava G (2021) FAPS: A fair, autonomous and privacy-preserving scheme for big data exchange based on oblivious transfer, Ether cheque and smart contracts. Infor Sci 544:469–484

    Article  MathSciNet  Google Scholar 

  22. Li Z, Ma C, Zhao M, Choi C (2019) Efficient oblivious transfer construction via multiple bits dual-mode cryptosystem for secure selection in the cloud. J Chinese Inst Eng 42(1):97–106

    Article  Google Scholar 

  23. Liu M, Hu Y (2019) Universally composable oblivious transfer from ideal lattice. Front Comput Sci 13:879–906

    Article  Google Scholar 

  24. Miyaji A, Rahman MS (2012) Privacy-preserving set operations in the presence of rational parties. In: 2012 26th International Conference on Advanced Information Networking and Applications Workshops, pp 869–874

  25. Mu Y, Zhang J, Varadharajan V (2002) m out of n oblivious transfer. In: Australasian Conference on Information Security and Privacy. Springer, pp 395–405

  26. Naor M, Pinkas B (1999) Oblivious transfer with adaptive queries. In: Annual International Cryptology Conference. Springer, pp 573–590

  27. Nargis I (2017) Efficient oblivious transfer from lossy threshold homomorphic encryption. In: International Conference on Cryptology in Africa. Springer, pp 165–183

  28. Peikert C, Vaikuntanathan V, Waters B (2008) A framework for efficient and composable oblivious transfer. In: Annual International Cryptology Conference. Springer, pp 554–571

  29. Quach W (2020) UC-secure OT from LWE, Revisited. In: Galdi C, Kolesnikov V (eds) Security and cryptography for networks. Springer International Publishing, Berlin, pp 192–211

    Chapter  Google Scholar 

  30. Rabin MO (1981) How to exchange secrets by oblivious transfer. Technical report TR-81, Aiken Computation Laboratory, Harvard

  31. Sen J (2013) Homomorphic encryption - theory and application. Theory and practice of cryptography and network security protocols and technologies. INTECH Publishers, Croatia, pp 1–32

    Chapter  Google Scholar 

  32. Staneková L, Stanek M (2005) Fast contract signing with batch oblivious transfer. In: Dittmann J, Katzenbeisser S, Uhl A (eds) Commun Multim Secur. Springer, Berlin Heidelberg, pp 1–10

    Google Scholar 

  33. Tassa T (2011) Generalized oblivious transfer by secret sharing. Des Codes Cryptogr 58(1):11–21

    Article  MathSciNet  Google Scholar 

  34. Yang YG, Sun SJ, Pan QX, Xu P (2015) Reductions between private information retrieval and oblivious transfer at the quantum level. Optik 126(21):3206–3209

    Article  Google Scholar 

  35. Zhang J, Wang Y (2005) Two provably secure k-out-of-n oblivious transfer schemes. Appl Math Comput 169(2):1211–1220

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Data Science, Shahid Beheshti University, Tehran, Iran

    Saeid Esmaeilzade & Ziba Eslami

  2. Information Science Research Department, Iranian Research Institute for Information Science and Technology (IranDoc), Tehran, Iran

    Nasrollah Pakniat

Authors
  1. Saeid Esmaeilzade
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Nasrollah Pakniat
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Ziba Eslami
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Nasrollah Pakniat.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Esmaeilzade, S., Pakniat, N. & Eslami, Z. A generic construction to build simple oblivious transfer protocols from homomorphic encryption schemes. J Supercomput 78, 72–92 (2022). https://doi.org/10.1007/s11227-021-03826-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-021-03826-0

Keywords