{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T22:02:17Z","timestamp":1768860137217,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T00:00:00Z","timestamp":1621468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s11227-021-03826-0","type":"journal-article","created":{"date-parts":[[2021,5,20]],"date-time":"2021-05-20T11:20:11Z","timestamp":1621509611000},"page":"72-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A generic construction to build simple oblivious transfer protocols from homomorphic encryption schemes"],"prefix":"10.1007","volume":"78","author":[{"given":"Saeid","family":"Esmaeilzade","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3925-1141","authenticated-orcid":false,"given":"Nasrollah","family":"Pakniat","sequence":"additional","affiliation":[]},{"given":"Ziba","family":"Eslami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,20]]},"reference":[{"issue":"3","key":"3826_CR1","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00145-016-9236-6","volume":"30","author":"G Asharov","year":"2017","unstructured":"Asharov G, Lindell Y, Schneider T, Zohner M (2017) More efficient oblivious transfer extensions. J Cryptol 30(3):805\u2013858","journal-title":"J Cryptol"},{"key":"3826_CR2","unstructured":"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"},{"key":"3826_CR3","doi-asserted-by":"crossref","unstructured":"Brassard G, Cr\u00e9peau C, Robert JM (1986) All-or-nothing disclosure of secrets. In: Conference on the Theory and Application of Cryptographic Techniques. Springer, pp 234\u2013238","DOI":"10.1007\/3-540-47721-7_17"},{"key":"3826_CR4","doi-asserted-by":"crossref","unstructured":"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\u201358","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"3826_CR5","doi-asserted-by":"crossref","unstructured":"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\u201906), pp 121\u2013128","DOI":"10.1109\/PRDC.2006.51"},{"key":"3826_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013183","DOI":"10.1007\/978-3-540-30580-4_12"},{"issue":"6","key":"3826_CR7","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman M (1976) New directions in cryptography. IEEE Trans Inform Theory 22(6):644\u2013654","journal-title":"IEEE Trans Inform Theory"},{"key":"3826_CR8","first-page":"768","volume":"2020","author":"N D\u00f6ttling","year":"2020","unstructured":"D\u00f6ttling N, Garg S, Hajiabadi M, Masny D, Wichs D (2020) Two-round oblivious transfer from CDH or LPN. Adv Cryptol - EUROCRYPT 2020:768\u2013797","journal-title":"Adv Cryptol - EUROCRYPT"},{"issue":"6","key":"3826_CR9","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even S, Goldreich O, Lempel A (1985) A randomized protocol for signing contracts. Commun ACM 28(6):637\u2013647","journal-title":"Commun ACM"},{"issue":"2","key":"3826_CR10","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s11227-013-0905-z","volume":"66","author":"CI Fan","year":"2013","unstructured":"Fan CI, Huang SY, Artan W (2013) Design and implementation of privacy preserving billing protocol for smart grid. J Supercomput 66(2):841\u2013862","journal-title":"J Supercomput"},{"key":"3826_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013499","DOI":"10.1007\/978-3-319-78375-8_16"},{"key":"3826_CR12","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-030-45727-3_23","volume-title":"Adv Cryptol - EUROCRYPT 2020","author":"V Goyal","year":"2020","unstructured":"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\u2013699"},{"key":"3826_CR13","first-page":"1011","volume":"2017","author":"E Hauck","year":"2017","unstructured":"Hauck E, Loss J (2017) Efficient and universally composable protocols for oblivious transfer from the CDH assumption. IACR Cryptol ePrint Archive 2017:1011","journal-title":"IACR Cryptol ePrint Archive"},{"key":"3826_CR14","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00145-020-09355-y","volume":"33","author":"C Hazay","year":"2020","unstructured":"Hazay C, Scholl P, Soria-Vazquez E (2020) Low cost constant round MPC combining BMR and oblivious transfer. J Cryptol 33:1732\u20131786","journal-title":"J Cryptol"},{"issue":"2","key":"3826_CR15","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1007\/s11277-017-4664-7","volume":"97","author":"H Jannati","year":"2017","unstructured":"Jannati H, Bahrak B (2017) An oblivious transfer protocol based on elgamal encryption for preserving location privacy. Wireless Personal Commun 97(2):3113\u20133123","journal-title":"Wireless Personal Commun"},{"key":"3826_CR16","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.1007\/s12652-018-0713-7"},{"key":"3826_CR17","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756","volume-title":"Introd Modern Cryptograp","author":"J Katz","year":"2007","unstructured":"Katz J, Lindell Y (2007) Introd Modern Cryptograp. Chapman and Hall\/CRC Press, Florida"},{"key":"3826_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013842","DOI":"10.1145\/2976749.2978357"},{"issue":"1","key":"3826_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12046-019-1235-5","volume":"45","author":"N Kundu","year":"2020","unstructured":"Kundu N, Debnath SK, Mishra D (2020) 1-out-of-2: post-quantum oblivious transfer protocols based on multivariate public key cryptography. S\u0101dhan\u0101 45(1):1\u201312","journal-title":"S\u0101dhan\u0101"},{"key":"3826_CR20","first-page":"1012","volume":"2020","author":"YF Lai","year":"2020","unstructured":"Lai YF, Galbraith SD, de Saint Guilhem CD (2020) Compact, efficient and UC-secure isogeny-based oblivious transfer. IACR Cryptol ePrint Arch 2020:1012","journal-title":"IACR Cryptol ePrint Arch"},{"key":"3826_CR21","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.ins.2020.08.116","volume":"544","author":"T Li","year":"2021","unstructured":"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\u2013484","journal-title":"Infor Sci"},{"issue":"1","key":"3826_CR22","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1080\/02533839.2018.1537809","volume":"42","author":"Z Li","year":"2019","unstructured":"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\u2013106","journal-title":"J Chinese Inst Eng"},{"key":"3826_CR23","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/s11704-018-6507-4","volume":"13","author":"M Liu","year":"2019","unstructured":"Liu M, Hu Y (2019) Universally composable oblivious transfer from ideal lattice. Front Comput Sci 13:879\u2013906","journal-title":"Front Comput Sci"},{"key":"3826_CR24","doi-asserted-by":"crossref","unstructured":"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\u2013874","DOI":"10.1109\/WAINA.2012.17"},{"key":"3826_CR25","doi-asserted-by":"crossref","unstructured":"Mu Y, Zhang J, Varadharajan V (2002) m out of n oblivious transfer. In: Australasian Conference on Information Security and Privacy. Springer, pp 395\u2013405","DOI":"10.1007\/3-540-45450-0_30"},{"key":"3826_CR26","doi-asserted-by":"crossref","unstructured":"Naor M, Pinkas B (1999) Oblivious transfer with adaptive queries. In: Annual International Cryptology Conference. Springer, pp 573\u2013590","DOI":"10.1007\/3-540-48405-1_36"},{"key":"3826_CR27","doi-asserted-by":"crossref","unstructured":"Nargis I (2017) Efficient oblivious transfer from lossy threshold homomorphic encryption. In: International Conference on Cryptology in Africa. Springer, pp 165\u2013183","DOI":"10.1007\/978-3-319-57339-7_10"},{"key":"3826_CR28","doi-asserted-by":"crossref","unstructured":"Peikert C, Vaikuntanathan V, Waters B (2008) A framework for efficient and composable oblivious transfer. In: Annual International Cryptology Conference. Springer, pp 554\u2013571","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"3826_CR29","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-030-57990-6_10","volume-title":"Security and cryptography for networks","author":"W Quach","year":"2020","unstructured":"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\u2013211"},{"key":"3826_CR30","unstructured":"Rabin MO (1981) How to exchange secrets by oblivious transfer. Technical report TR-81, Aiken Computation Laboratory, Harvard"},{"key":"3826_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.5772\/56823","volume-title":"Theory and practice of cryptography and network security protocols and technologies","author":"J Sen","year":"2013","unstructured":"Sen J (2013) Homomorphic encryption - theory and application. Theory and practice of cryptography and network security protocols and technologies. INTECH Publishers, Croatia, pp 1\u201332"},{"key":"3826_CR32","first-page":"1","volume-title":"Commun Multim Secur","author":"L Stanekov\u00e1","year":"2005","unstructured":"Stanekov\u00e1 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\u201310"},{"issue":"1","key":"3826_CR33","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/s10623-010-9378-8","volume":"58","author":"T Tassa","year":"2011","unstructured":"Tassa T (2011) Generalized oblivious transfer by secret sharing. Des Codes Cryptogr 58(1):11\u201321","journal-title":"Des Codes Cryptogr"},{"issue":"21","key":"3826_CR34","doi-asserted-by":"publisher","first-page":"3206","DOI":"10.1016\/j.ijleo.2015.07.149","volume":"126","author":"YG Yang","year":"2015","unstructured":"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\u20133209","journal-title":"Optik"},{"issue":"2","key":"3826_CR35","doi-asserted-by":"crossref","first-page":"1211","DOI":"10.1016\/j.amc.2004.10.059","volume":"169","author":"J Zhang","year":"2005","unstructured":"Zhang J, Wang Y (2005) Two provably secure k-out-of-n oblivious transfer schemes. Appl Math Comput 169(2):1211\u20131220","journal-title":"Appl Math Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-021-03826-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-021-03826-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,3]],"date-time":"2023-11-03T23:37:06Z","timestamp":1699054626000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-021-03826-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,20]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["3826"],"URL":"https:\/\/doi.org\/10.1007\/s11227-021-03826-0","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,20]]},"assertion":[{"value":"17 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}