{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T16:55:52Z","timestamp":1784134552652,"version":"3.55.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/tifs.2015.2503268","type":"journal-article","created":{"date-parts":[[2015,11,24]],"date-time":"2015-11-24T19:29:34Z","timestamp":1448393374000},"page":"642-657","source":"Crossref","is-referenced-by-count":6,"title":["Piecewise Function Approximation With Private Data"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3835-9679","authenticated-orcid":false,"given":"Riccardo","family":"Lazzeretti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tommaso","family":"Pignata","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauro","family":"Barni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Extending oblivious transfers efficiently","volume":"2729","author":"ishai","year":"2003","journal-title":"Adv Cryptology"},{"key":"ref38","first-page":"535","article-title":"More efficient oblivious transfer and extensions for faster secure computation","author":"asharov","year":"2013","journal-title":"Proc ACM SIGSAC Conf Comput Commun Secur"},{"key":"ref33","author":"giry","year":"2009","journal-title":"Cryptographic Key Length Recommendation"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2012.6412625"},{"key":"ref31","first-page":"927","article-title":"Secure multiparty computation of approximations","author":"feigenbaum","year":"2001","journal-title":"Automata Languages and Programming"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2008.2011087"},{"key":"ref37","first-page":"97","article-title":"Precomputing oblivious transfer","volume":"963","author":"beaver","year":"1995","journal-title":"Adv Cryptology"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73458-1_30"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_31"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref28","first-page":"1","article-title":"Practical covertly secure MPC for dishonest majority—Or: Breaking the SPDZ limits","author":"damg\u00e5rd","year":"2013","journal-title":"Computers and Security"},{"key":"ref27","first-page":"643","article-title":"Multiparty computation from somewhat homomorphic encryption","author":"damg\u00e5rd","year":"2012","journal-title":"Adv Cryptology"},{"key":"ref29","first-page":"100","article-title":"How to combine homomorphic encryption and garbled circuits—Improved circuits and computing the minimum distance efficiently","author":"kolesnikov","year":"2009","journal-title":"Proc 1st Int Workshop Signal Process EncryptEd Domain (SPEED)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2219653"},{"key":"ref1","first-page":"17","article-title":"Protection and retrieval of encrypted multimedia content: When cryptography meets signal processing","volume":"2007","author":"erkin","year":"2007","journal-title":"EURASIP J Inf Security"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2262273"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2011.6123132"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref26","article-title":"How to exchange secrets with oblivious transfer","author":"rabin","year":"1981"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2010.5711460"},{"key":"ref50","first-page":"24","article-title":"Approximation with artificial neural networks","author":"cs\u00e1ji","year":"2001"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2010.5711458"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2013.6707794"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5947692"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"ref53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-10433-6_1","article-title":"Improved garbled circuit building blocks and applications to auctions and computing minima","author":"kolesnikov","year":"2009","journal-title":"Proc Cryptology and Network Security"},{"key":"ref52","first-page":"1","article-title":"Secure computation on floating point numbers","author":"aliasgari","year":"2013","journal-title":"Proc NDSS"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6855039"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2228343"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_14"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/WIFS.2010.5711448"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref16","first-page":"1","article-title":"Packed ciphertexts in LWEbased homomorphic encryption","volume":"7778","author":"brakerski","year":"2013","journal-title":"Proc Public Key Cryptography"},{"key":"ref17","first-page":"641","article-title":"Bootstrapping for HElib","author":"halevi","year":"2015","journal-title":"Adv Cryptology"},{"key":"ref18","first-page":"617","article-title":"FHEW: Bootstrapping homomorphic encryption in less than a second","volume":"9056","author":"ducas","year":"0","journal-title":"Adv Cryptology"},{"key":"ref19","first-page":"24","article-title":"Fully homomorphic encryption over the integers","author":"van dijk","year":"2010","journal-title":"Proc Adv Cryptol (EUROCRYPT)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2230218"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5230-9"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2108650"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2438131"},{"key":"ref8","article-title":"iDASH healthcare privacy protection challenge","year":"2015","journal-title":"Proc iDASH Privacy Secur Workshop"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2361407.2361435"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40203-6_24"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_8"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.39"},{"key":"ref48","first-page":"1","article-title":"ABY—A framework for efficient mixed-protocol secure two-party computation","author":"demmler","year":"2015","journal-title":"Proc 21st Annu Netw Distrib Syst Secur Symp (NDSS)"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"283","DOI":"10.3233\/JCS-130464","article-title":"A systematic approach to practically efficient general two-party secure function evaluation protocols and their modular design","volume":"21","author":"kolesnikov","year":"2013","journal-title":"J Comput Secur"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/978-3-540-70583-3_40","article-title":"Improved garbled circuit: Free XOR gates and applications","volume":"5126","author":"kolesnikov","year":"2008","journal-title":"Automata Languages and Programming"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2230540"},{"key":"ref44","first-page":"35","article-title":"Faster secure two-party computation using garbled circuits","author":"huang","year":"2011","journal-title":"Proc Usenix Secur Symp"},{"key":"ref43","first-page":"250","article-title":"Secure two-party computation is practical","author":"pinkas","year":"2009","journal-title":"Adv Cryptology"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/7365556\/7336550.pdf?arnumber=7336550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:58:04Z","timestamp":1642003084000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7336550\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":57,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2015.2503268","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}