{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:44:11Z","timestamp":1740149051202,"version":"3.37.3"},"reference-count":35,"publisher":"Wiley","license":[{"start":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T00:00:00Z","timestamp":1607126400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"],"award-info":[{"award-number":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Major Innovation Project of Science and Technology of Shandong Province","award":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"],"award-info":[{"award-number":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"]}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"],"award-info":[{"award-number":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014417","name":"Fundamental Research Fund of Shandong University","doi-asserted-by":"publisher","award":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"],"award-info":[{"award-number":["61572294","61632020","2018CXGC0702","ZR2017MF021","2017JC019"]}],"id":[{"id":"10.13039\/100014417","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Security and Communication Networks"],"published-print":{"date-parts":[[2020,12,5]]},"abstract":"<jats:p>Oblivious transfer (OT) is a cryptographic primitive originally used to transfer a collection of messages from the sender to the receiver in an oblivious manner. OT extension protocol reduces expensive asymmetric operations by running a small number of OT instances first and then cheap symmetric operations. While most earlier works discussed security model or communication and computation complexity of OT in general case, we focus on concrete application scenarios, especially where the sender in the OT protocol is a database with less computation and limited interaction capability. In this paper, we propose a generic outsourced OT extension protocol (<jats:inline-formula>\n                     <a:math xmlns:a=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M1\">\n                        <a:mi mathvariant=\"double-struck\">O<\/a:mi>\n                        <a:mi mathvariant=\"sans-serif\">Tex<\/a:mi>\n                     <\/a:math>\n                  <\/jats:inline-formula>) that outsources all the asymmetric operations of the sender to a semihonest server so as to adapt to specific scenarios above. We give <jats:inline-formula>\n                     <e:math xmlns:e=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M2\">\n                        <e:mi mathvariant=\"double-struck\">O<\/e:mi>\n                        <e:mi mathvariant=\"sans-serif\">Tex<\/e:mi>\n                     <\/e:math>\n                  <\/jats:inline-formula> a standard security definition, and the proposed protocol is proven secure in the semihonest model. In <jats:inline-formula>\n                     <i:math xmlns:i=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M3\">\n                        <i:mi mathvariant=\"double-struck\">O<\/i:mi>\n                        <i:mi mathvariant=\"sans-serif\">Tex<\/i:mi>\n                     <\/i:math>\n                  <\/jats:inline-formula>, the sender works on the fly and performs only symmetric operations locally. Whatever the number of rounds OT to be executed and the length of messages in OT to be sent, our protocol realizes optimal complexity. Besides, <jats:inline-formula>\n                     <m:math xmlns:m=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M4\">\n                        <m:mi mathvariant=\"double-struck\">O<\/m:mi>\n                        <m:mi mathvariant=\"sans-serif\">Tex<\/m:mi>\n                     <\/m:math>\n                  <\/jats:inline-formula> can be used to construct high-level protocols, such as private membership test (PMT) and private set intersection (PSI). We believe our <jats:inline-formula>\n                     <q:math xmlns:q=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" id=\"M5\">\n                        <q:mi mathvariant=\"double-struck\">O<\/q:mi>\n                        <q:mi mathvariant=\"sans-serif\">Tex<\/q:mi>\n                     <\/q:math>\n                  <\/jats:inline-formula> construction may be a building block in other applications as well.<\/jats:p>","DOI":"10.1155\/2020\/8847487","type":"journal-article","created":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T02:35:07Z","timestamp":1607222107000},"page":"1-12","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Outsourced Oblivious Transfer Extension Protocol and Its Applications"],"prefix":"10.1155","volume":"2020","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6883-9724","authenticated-orcid":true,"given":"Shengnan","family":"Zhao","sequence":"first","affiliation":[{"name":"School of Software, Shandong University, Jinan 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9927-0534","authenticated-orcid":true,"given":"Xiangfu","family":"Song","sequence":"additional","affiliation":[{"name":"School of Software, Shandong University, Jinan 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4909-367X","authenticated-orcid":true,"given":"Han","family":"Jiang","sequence":"additional","affiliation":[{"name":"School of Software, Shandong University, Jinan 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6386-9817","authenticated-orcid":true,"given":"Ming","family":"Ma","sequence":"additional","affiliation":[{"name":"School of Software, Shandong University, Jinan 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7322-7295","authenticated-orcid":true,"given":"Zhihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Shandong Normal University, Jinan 250358, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5277-8453","authenticated-orcid":true,"given":"Qiuliang","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Software, Shandong University, Jinan 250100, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"first-page":"162","article-title":"How to generate and exchange secrets","author":"C.-C. Y. Andrew","key":"1"},{"key":"2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1145\/3335741.3335755","article-title":"How to play any mental game, or a completeness theorem for protocols with honest majority","volume-title":"Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali","author":"O. Goldreich","year":"2019"},{"first-page":"643","article-title":"Multiparty computation from somewhat homomorphic encryption","author":"I. Damg\u00e5rd","key":"3"},{"first-page":"145","article-title":"Extending oblivious transfers efficiently","author":"Y. Ishai","key":"4"},{"first-page":"54","article-title":"Improved ot extension for transferring short secrets","author":"V. Kolesnikov","key":"5"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"first-page":"234","article-title":"All-or-nothing disclosure of secrets","author":"G. Brassard","key":"7"},{"first-page":"159","article-title":"Efficient 1-out-n oblivious transfer schemes","author":"W.-G. Tzeng","key":"8"},{"first-page":"395","article-title":"m out of n oblivious transfer","author":"Y. Mu","key":"9"},{"first-page":"172","article-title":"Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries","author":"C.-K. Chu","key":"10"},{"first-page":"421","article-title":"Hiding the input-size in secure two-party computation","author":"Y. Lindell","key":"11"},{"first-page":"33","article-title":"Laconic oblivious transfer and its applications","author":"C. Cho","key":"12"},{"first-page":"818","article-title":"Efficient batched oblivious PRF with applications to private set intersection","author":"V. Kolesnikov","key":"13"},{"key":"14","first-page":"2017","article-title":"Practical multi-party private set intersection from symmetric-key techniques","volume":"799","author":"V. Kolesnikov","year":"2017","journal-title":"IACR Cryptology ePrint Archive"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/3154794"},{"first-page":"401","article-title":"Spot-light: lightweight private set intersection from sparse ot extension","author":"B. Pinkas","key":"16"},{"first-page":"34","article-title":"Private set intersection in the internet setting from lightweight oblivious PRF","author":"M. Chase","key":"17"},{"first-page":"125","article-title":"Efficient circuit-based psi via cuckoo hashing","author":"B. Pinkas","key":"18"},{"first-page":"464","article-title":"Combining private set-intersection with secure two-party computation","author":"M. Ciampi","key":"19"},{"first-page":"122","article-title":"Efficient circuit-based psi with linear communication","author":"B. Pinkas","key":"20"},{"key":"21","first-page":"2020","volume-title":"Catalic: Delegated PSI Cardinality with Applications to Contact Tracing","author":"T. Duong","year":"2020"},{"key":"22","first-page":"2005","article-title":"How to exchange secrets with oblivious transfer","volume":"187","author":"M. O. Rabin","year":"2005","journal-title":"IACR Cryptology ePrint Archive"},{"first-page":"52","article-title":"Efficient fully-simulatable oblivious transfer","author":"A. Y. Lindell","key":"23"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/tifs.2012.2184096"},{"first-page":"179","article-title":"Universally composable adaptive oblivious transfer","author":"M. Green","key":"25"},{"first-page":"97","article-title":"Precomputing oblivious transfer","author":"D. Beaver","key":"26"},{"first-page":"479","article-title":"Correlated pseudorandomness and the complexity of private computations","author":"D. Beaver","key":"27"},{"first-page":"325","article-title":"The relationship between public key encryption and oblivious transfer","author":"Y. Gertner","key":"28"},{"first-page":"126","article-title":"On the impossibility of basing trapdoor functions on trapdoor predicates","author":"Y. Gertner","key":"29"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.3233\/jcs-150540"},{"first-page":"309","article-title":"Endemic oblivious transfer","author":"D. Mansy","key":"31"},{"first-page":"636","article-title":"Scalable private set union from symmetric-key techniques","author":"V. Kolesnikov","key":"32"},{"volume-title":"Foundations of Cryptography: Volume 2, Basic Applications","year":"2009","author":"O. Goldreich","key":"33"},{"first-page":"303","article-title":"Keyword search and oblivious pseudorandom functions","author":"M. J. Freedman","key":"34"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"}],"container-title":["Security and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8847487.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8847487.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/scn\/2020\/8847487.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,6]],"date-time":"2020-12-06T02:35:12Z","timestamp":1607222112000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/scn\/2020\/8847487\/"}},"subtitle":[],"editor":[{"given":"Zhihua","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2020,12,5]]},"references-count":35,"alternative-id":["8847487","8847487"],"URL":"https:\/\/doi.org\/10.1155\/2020\/8847487","relation":{},"ISSN":["1939-0122","1939-0114"],"issn-type":[{"type":"electronic","value":"1939-0122"},{"type":"print","value":"1939-0114"}],"subject":[],"published":{"date-parts":[[2020,12,5]]}}}