{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:29Z","timestamp":1740169109039,"version":"3.37.3"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2908230","type":"journal-article","created":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T18:50:05Z","timestamp":1553885405000},"page":"42798-42815","source":"Crossref","is-referenced-by-count":3,"title":["Optimally Efficient Secure Scalar Product With Applications in Cloud Computing"],"prefix":"10.1109","volume":"7","author":[{"given":"Babak","family":"Siabi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Berenjkoub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1562-5105","authenticated-orcid":false,"given":"Willy","family":"Susilo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"234","article-title":"Fast secure scalar product protocol with (almost) optimal efficiency","author":"zhu","year":"2015","journal-title":"Collaborative Computing Networking Applications and Worksharing"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34117-5_15"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-005-0419-9"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_9"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1165555.1165570"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1504\/IJESDF.2015.067985"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775142"},{"key":"ref35","first-page":"337","article-title":"A two-party protocol with trusted initializer for computing the inner product","author":"dowsley","year":"2010","journal-title":"Information Security Applications"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-014-0247-8"},{"article-title":"Unconditionally secure commitment and oblivious transfer schemes using private channels and a trusted initializer","year":"1999","author":"rivest","key":"ref28"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_28"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.71"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2017.02.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2015.2476783"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10586-017-1649-y"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20465-4_11"},{"key":"ref23","first-page":"446","article-title":"Commodity-based cryptography","author":"beaver","year":"1997","journal-title":"Proc 19th Annu ACM Symp Theory Comput"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_35"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9214-4"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/090755886"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559862"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/392439"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2013.08.004"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14577-3_6"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_32"},{"key":"ref10","first-page":"104","article-title":"On private scalar product computation for privacy-preserving data mining","author":"goethals","year":"2004","journal-title":"Information Security and Cryptology—ICISC"},{"key":"ref11","first-page":"273","article-title":"Privacy-preserving cooperative scientific computations","volume":"1","author":"du","year":"2001","journal-title":"Proc CSFW"},{"key":"ref40","first-page":"209","article-title":"A new efficient privacy-preserving scalar product protocol","author":"amirbekyan","year":"2007","journal-title":"Proc 6th Australasian Conf Data Mining Analytics"},{"key":"ref12","first-page":"102","article-title":"Privacy-preserving cooperative statistical analysis","author":"du","year":"2001","journal-title":"Proc of the 17th Ann Computer Sec App Conf"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15497-3_9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/PASSAT\/SocialCom.2011.19"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2011.224"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2017.04.013"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-011-0153-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2462410.2462430"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref3","first-page":"87","article-title":"Multiparty computations ensuring privacy of each party’s input and correctness of the result","author":"chaum","year":"2006","journal-title":"Adv Cryptology"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73014"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62214"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.21236\/ADA457144"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32928-9_13"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772867"},{"key":"ref46","first-page":"420","article-title":"Efficient multiparty protocols using circuit randomization","author":"beaver","year":"1991","journal-title":"Proc Annu Int Cryptol Conf"},{"journal-title":"On the security of an unconditionally secure universally composable inner product protocol","year":"2018","author":"siabi","key":"ref45"},{"journal-title":"Foundations of Cryptography Basic Applications","year":"2009","author":"goldreich","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2010.172"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06608-0_50"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2808769.2808774"},{"key":"ref43","first-page":"127","article-title":"A practical approach to solve secure multi-party computation problems","author":"du","year":"2002","journal-title":"Proceedings New Security Paradigms Workshop"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08676309.pdf?arnumber=8676309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:47Z","timestamp":1628624447000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8676309\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":56,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2908230","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}