{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T09:21:50Z","timestamp":1778145710603,"version":"3.51.4"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Dutch National COMMIT Programme"},{"name":"Dutch Science Foundation through the Vrije Competitie Project entitled Applications of Arithmetic Secret Sharing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1109\/tifs.2014.2370255","type":"journal-article","created":{"date-parts":[[2014,11,13]],"date-time":"2014-11-13T19:35:32Z","timestamp":1415907332000},"page":"445-457","source":"Crossref","is-referenced-by-count":25,"title":["A Framework for Secure Computations With Two Non-Colluding Servers and Multiple Clients, Applied to Recommendations"],"prefix":"10.1109","volume":"10","author":[{"given":"Thijs","family":"Veugen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robbert","family":"de Haan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald","family":"Cramer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Muller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.30"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-3-642-15317-4_13","article-title":"Improved primitives for secure multiparty integer computation","volume":"6280","author":"catrina","year":"2010","journal-title":"Security and Cryptography for Networks"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2013.2288131"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2002.1004361"},{"key":"ref14","first-page":"643","article-title":"Multiparty computation from somewhat homomorphic encryption","volume":"7417","author":"damg\u00e5rd","year":"2012","journal-title":"Advances in Cryptology"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-40203-6_1","article-title":"Practical covertly secure MPC for dishonest majority—Or: Breaking the SPDZ limits","volume":"8134","author":"damg\u00e5rd","year":"2013","journal-title":"Computer Security (Lecture Notes in Computer Science)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"ref17","first-page":"119","article-title":"Practical two-party computation based on the conditional gate","volume":"3329","author":"schoenmakers","year":"2004","journal-title":"Advances in Cryptology"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3"},{"key":"ref19","first-page":"218","article-title":"How to play any mental game or a completeness theorem for protocols with honest majority","author":"goldreich","year":"1987","journal-title":"Proc of the 19th Annual ACM Symposium on Theory of Computing (STOC)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1504\/IJACT.2014.062738"},{"key":"ref4","first-page":"486","article-title":"Secure two-party k-means clustering","author":"bunn","year":"2007","journal-title":"Proc 14th ACM Conf Comput Commun Secur"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/11681878_15","article-title":"Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation","author":"damg\u00e5rd","year":"2006","journal-title":"Theory of Cryptography"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2190726"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2003.1250993"},{"key":"ref5","first-page":"104","article-title":"On private scalar product computation for privacy-preserving data mining","author":"goethals","year":"2004","journal-title":"Proc Int Conf Inf Security Cryptol"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1029179.1029204"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2219653"},{"key":"ref9","first-page":"801","article-title":"Privacy-preserving matrix factorization","author":"nikolaenko","year":"2013","journal-title":"Proc ACM SIGSAC Conf Comput Commun Secur"},{"key":"ref1","first-page":"169","article-title":"Semi-homomorphic encryption and multiparty computation","volume":"6632","author":"bendlin","year":"2011","journal-title":"Advances in Cryptology"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref21","first-page":"420","article-title":"Efficient multiparty protocols using circuit randomization","author":"beaver","year":"1991","journal-title":"Advances in Cryptology"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref26","first-page":"1","article-title":"Fast cut-and-choose based protocols for malicious and covert adversaries","volume":"8043","author":"lindell","year":"2013","journal-title":"Advances in Cryptology"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_2"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/7019030\/06955802.pdf?arnumber=6955802","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:55Z","timestamp":1642004875000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6955802\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2014.2370255","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}