{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:00:22Z","timestamp":1769979622548,"version":"3.49.0"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/csf.2015.13","type":"proceedings-article","created":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T21:35:20Z","timestamp":1441661720000},"page":"75-89","source":"Crossref","is-referenced-by-count":13,"title":["Automatic Proofs of Privacy of Secure Multi-party Computation Protocols against Active Adversaries"],"prefix":"10.1109","author":[{"given":"Martin","family":"Pettai","sequence":"first","affiliation":[]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/509978.509980"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33027-8_4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33167-1_33"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2484313.2484364"},{"key":"ref34","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)","author":"ben-or","year":"1988","journal-title":"STOC"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516752"},{"key":"ref11","article-title":"From Input Private to Universally Composable Secure Multiparty Computation Primitives","author":"bogdanov","year":"2014","journal-title":"Proc 27th IEEE Symposium on the Foundations of Computer Science"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12475-9_11"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13013-7_6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-012-0177-2"},{"key":"ref17","author":"jagom\u00e4gis","year":"2010","journal-title":"SecreC a Privacy-Aware Programming Language with Applications in Data Mining"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2517872.2517874"},{"key":"ref19","doi-asserted-by":"crossref","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 the Third Theory of Cryptography Conference"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382272"},{"key":"ref4","first-page":"160","article-title":"Asynchronous Multiparty Computation: Theory and Implementation","volume":"5443","author":"damg\u00e5rd","year":"2009","journal-title":"Public Key Cryptography"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_5"},{"key":"ref3","first-page":"20","article-title":"Fairplay-a secure two-party computation system","author":"malkhi","year":"2004","journal-title":"SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium"},{"key":"ref6","first-page":"192","article-title":"Sharemind: A framework for fast privacy-preserving computations","volume":"5283","author":"bogdanov","year":"2008","journal-title":"ESORICS"},{"key":"ref29","first-page":"365","article-title":"A Type System for Computationally Secure Information Flow","volume":"3623","author":"laud","year":"2005","journal-title":"FCT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046787"},{"key":"ref7","first-page":"223","article-title":"SEPIA: Privacy-preserving aggregation of multi-domain network events and statistics","author":"burkhart","year":"2010","journal-title":"USENIX Security Symposium"},{"key":"ref2","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":"STOC"},{"key":"ref9","article-title":"Billion-Gate Secure Computation with Malicious Adversaries","author":"kreuter","year":"2012","journal-title":"Cryptology ePrint Archive"},{"key":"ref1","article-title":"Secure multi-party data analysis: end user validation and practical experiments","author":"bogdanov","year":"2013","journal-title":"Cryptology ePrint Archive"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref22","author":"bogdanov","year":"2013","journal-title":"Sharemind Programmable Secure Computations with Practical Applications"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656"},{"key":"ref24","first-page":"409","article-title":"The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs","volume":"4004","author":"bellare","year":"2006","journal-title":"Eurocrypt"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30428-6_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2006.1"},{"key":"ref25","first-page":"71","article-title":"Symmetric Encryption in Automatic Analyses for Confidentiality against Active Adversaries","author":"laud","year":"2004","journal-title":"IEEE Symposium on Security and Privacy"}],"event":{"name":"2015 IEEE 28th Computer Security Foundations Symposium (CSF)","location":"Verona","start":{"date-parts":[[2015,7,13]]},"end":{"date-parts":[[2015,7,17]]}},"container-title":["2015 IEEE 28th Computer Security Foundations Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7243288\/7243713\/07243726.pdf?arnumber=7243726","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T02:24:17Z","timestamp":1541471057000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7243726\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/csf.2015.13","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}