{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T04:59:29Z","timestamp":1782968369970,"version":"3.54.5"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-1035894"],"award-info":[{"award-number":["CNS-1035894"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["ECCS-1247944"],"award-info":[{"award-number":["ECCS-1247944"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["ECCS-1343306"],"award-info":[{"award-number":["ECCS-1343306"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61170216"],"award-info":[{"award-number":["61170216"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61228202"],"award-info":[{"award-number":["61228202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2015,1,1]]},"DOI":"10.1109\/tdsc.2014.2309134","type":"journal-article","created":{"date-parts":[[2014,2,28]],"date-time":"2014-02-28T19:02:50Z","timestamp":1393614170000},"page":"45-57","source":"Crossref","is-referenced-by-count":69,"title":["Collusion-Tolerable Privacy-Preserving Sum and Product Calculation without Secure Channel"],"prefix":"10.1109","volume":"12","author":[{"given":"Taeho","family":"Jung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meng","family":"Wan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"ref38","article-title":"A general survey of privacy-preserving data mining models and algorithms","author":"aggarwal","year":"2008","journal-title":"Privacy-preserving Data Mining Models and Algorithms"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_9"},{"key":"ref30","first-page":"48","article-title":"The decision Diffie-Hellman problem","author":"boneh","year":"0","journal-title":"3rd Algorithmic Number Theory Symp"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1749603.1749605"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848175"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567071"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.237"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/12.663768"},{"key":"ref11","first-page":"4","article-title":"Privacy-preserving aggregation of time-series data","volume":"2 2011","author":"shi","year":"0","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref12","doi-asserted-by":"crossref","DOI":"10.1201\/9781439821916","author":"menezes","year":"1996","journal-title":"Handbook of Applied Cryptography"},{"key":"ref13","first-page":"111","article-title":"A scalable scheme for privacy-preserving aggregation of time-series data","author":"joye","year":"0","journal-title":"Proc Int'l Conf Financial Cryptography and Data Security"},{"key":"ref14","first-page":"200","article-title":"Privacy-preserving stream aggregation with fault tolerance","author":"chan","year":"0","journal-title":"Proc Int'l Conf Financial Cryptography and Data Security"},{"key":"ref15","first-page":"221","article-title":"Fault-tolerant privacy-preserving statistics","author":"jawurek","year":"0","journal-title":"Proc 12th Int Conf Privacy Enhancing Technol"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2457317.2457343"},{"key":"ref17","first-page":"60","article-title":"Efficient privacy-preserving stream aggregation in mobile sensing with low aggregation error","author":"li","year":"0","journal-title":"Proc 13th Int Symp Privacy Enhancing Technol"},{"key":"ref18","first-page":"1","article-title":"Differential privacy","author":"dwork","year":"0","journal-title":"Proc 33rd Int Colloq Automata Lang Program"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6847974"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/974121.974131"},{"key":"ref4","first-page":"129","article-title":"Implementing gentry’s fully-homomorphic\ufffdencryption scheme","author":"gentry","year":"0","journal-title":"Proc 30th Annu Int Conf Theory Appl Cryptographic Techn Adv Cryptology"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566844"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1525856.1525858"},{"key":"ref29","year":"0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2046660.2046682"},{"key":"ref8","year":"0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MOBIQUITOUS.2005.25"},{"key":"ref2","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/772862.772867"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835868"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.38"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536466"},{"key":"ref42","first-page":"457","article-title":"A cost-effective pay-per-multiplication comparison method for millionaires","author":"fischlin","year":"0","journal-title":"Proc Cryptographers' Track RSA Conf Topics Cryptol"},{"key":"ref24","year":"0"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/12.795128"},{"key":"ref23","year":"0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567085"},{"key":"ref43","year":"0"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6567070"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/7008601\/06750696.pdf?arnumber=6750696","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:36Z","timestamp":1642004856000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6750696\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,1]]},"references-count":43,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2014.2309134","relation":{},"ISSN":["1545-5971"],"issn-type":[{"value":"1545-5971","type":"print"}],"subject":[],"published":{"date-parts":[[2015,1,1]]}}}