{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:21:19Z","timestamp":1742401279284,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"European Research Council Starting","award":["279447"],"award-info":[{"award-number":["279447"]}]},{"DOI":"10.13039\/501100001732","name":"Danish National Research Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001732","id-type":"DOI","asserted-by":"crossref"}]},{"name":"The National Science Foundation of China, for the Sino-Danish Center for the Theory of Interactive Computation","award":["61061130540"],"award-info":[{"award-number":["61061130540"]}]},{"name":"CFEM Research Centre (Danish Strategic Research Council) within which part of this work was performed"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1109\/tifs.2015.2476783","type":"journal-article","created":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T18:31:56Z","timestamp":1441305116000},"page":"59-73","source":"Crossref","is-referenced-by-count":12,"title":["Unconditionally Secure, Universally Composable Privacy Preserving Linear Algebra"],"prefix":"10.1109","volume":"11","author":[{"given":"Bernardo","family":"David","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[]},{"given":"Jeroen","family":"van de Graaf","sequence":"additional","affiliation":[]},{"given":"Davidson","family":"Marques","sequence":"additional","affiliation":[]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[]},{"given":"Adriana C. B.","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"681","article-title":"A new approach to practical active-secure two-party computation","volume":"7417","author":"nielsen","year":"2012","journal-title":"Advances in Cryptology"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660365"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/310889.310923"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258637"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_11"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_27"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_1"},{"key":"ref35","first-page":"476","article-title":"Cut-and-choose Yao-based secure computation in the online\/offline and batch settings","volume":"8617","author":"lindell","year":"2014","journal-title":"Advances in Cryptology"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_32"},{"key":"ref28","first-page":"1","article-title":"Universally composable zero-knowledge arguments and commitments from signature cards","author":"hofheinz","year":"2005","journal-title":"Proc of Central European Conf on Cryptology"},{"key":"ref27","first-page":"509","article-title":"On the composability of statistically secure bit commitments","volume":"14","author":"dowsley","year":"2013","journal-title":"J Internet Technol"},{"key":"ref29","first-page":"115","article-title":"Universally composable multi-party computation using tamperproof hardware","volume":"4515","author":"katz","year":"2007","journal-title":"Advances in Cryptology"},{"key":"ref2","first-page":"11","article-title":"Multiparty unconditionally secure protocols (extended abstract)","author":"chaum","year":"1988","journal-title":"Proc 20th Annu ACM Symp Theory Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17955-6_25"},{"key":"ref20","first-page":"19","article-title":"Universally composable commitments (extended abstract)","volume":"2139","author":"canetti","year":"2001","journal-title":"Advances in Cryptology"},{"key":"ref22","first-page":"554","article-title":"A framework for efficient and composable oblivious transfer","volume":"5157","author":"peikert","year":"2008","journal-title":"Advances in Cryptology"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/509978.509980"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E94.A.725"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.71"},{"key":"ref26","first-page":"103","article-title":"On the possibility of universally composable commitments based on noisy channels","author":"dowsley","year":"2008","journal-title":"Proc 8th Simpósio Brasileiro Segurança Inf Sistemas Comput (SBSEG)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_4"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_34"},{"journal-title":"Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer","year":"1999","author":"rivest","key":"ref51"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48405-1_8"},{"article-title":"Actively secure two-party computation: Efficient beaver triple generation","year":"2013","author":"pullonen","key":"ref58"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24852-1_26"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016501125022"},{"key":"ref53","first-page":"1","article-title":"Information-theoretically secure oblivious polynomial evaluation in the commodity-based model","volume":"14","author":"tonicelli","year":"2014","journal-title":"Int J Inf Secur"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/10958513_12"},{"key":"ref10","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","volume":"3876","author":"damg\u00e5rd","year":"2006","journal-title":"Proceedings of Theoretical Cryptography Conference (TCC)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s12599-011-0153-9"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2462410.2462430"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2011.224"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.018"},{"key":"ref15","first-page":"192","article-title":"Sharemind: A framework for fast privacy-preserving computations","author":"bogdanov","year":"2008","journal-title":"Proc European Symp Research in Computer Security (ESORICS)"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-642-32946-3_5","article-title":"Deploying secure multi-party computation for financial data analysis (short paper)","author":"bogdanov","year":"2012","journal-title":"Proc 16th Int Conf Financial Cryptogr Data Secur (FC)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516744"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28420"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1109\/SFCS.1982.38","article-title":"Protocols for secure computations (extended abstract)","author":"yao","year":"1982","journal-title":"Proc 23rd Annu Symp Foundations Comput Sci"},{"key":"ref6","first-page":"110","article-title":"Committed oblivious transfer and private multi-party computation","volume":"963","author":"cr\u00e9peau","year":"1995","journal-title":"Advances in Cryptology"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-3-540-30576-7_16","article-title":"Secure computation of the mean and related statistics","volume":"3378","author":"kiltz","year":"2005","journal-title":"Theory of Cryptography"},{"key":"ref7","first-page":"104","article-title":"On private scalar product computation for privacy-preserving data mining","volume":"3506","author":"goethals","year":"2005","journal-title":"Information Security and Cryptology"},{"article-title":"A study of several specific secure two-party computation problems","year":"2001","author":"du","key":"ref49"},{"key":"ref9","first-page":"15","article-title":"SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics","author":"burkhart","year":"2010","journal-title":"Proc 19th USENIX Conf Security"},{"key":"ref46","first-page":"97","article-title":"Precomputing oblivious transfer","volume":"963","author":"beaver","year":"1995","journal-title":"Advances in Cryptology"},{"key":"ref45","first-page":"205","article-title":"A randomized protocol for signing contracts","author":"even","year":"1982","journal-title":"Advances in Cryptology"},{"key":"ref48","first-page":"169","article-title":"Semihomomorphic encryption and multiparty computation","volume":"6632","author":"bendlin","year":"2011","journal-title":"Advances in Cryptology"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"ref44","first-page":"1","article-title":"ABY—A framework for efficient mixed-protocol secure two-party computation","author":"demmler","year":"2014","journal-title":"Proc 22nd Annu Netw Distrib Syst Secur Symp (NDSS)"},{"key":"ref43","first-page":"1","article-title":"Practical covertly secure MPC for dishonest majority—Or: Breaking the SPDZ limits","author":"damg\u00e5rd","year":"2013","journal-title":"Proc European Symp Research in Computer Security (ESORICS)"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/7313073\/07239604.pdf?arnumber=7239604","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:58:57Z","timestamp":1642003137000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7239604\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":59,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tifs.2015.2476783","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}