{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:14:04Z","timestamp":1769980444923,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":66,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T00:00:00Z","timestamp":1572998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Fundacao para a Ciencia e Tecnologia","award":["FCT-PD\/BD\/113967\/201"],"award-info":[{"award-number":["FCT-PD\/BD\/113967\/201"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,11,6]]},"DOI":"10.1145\/3319535.3354205","type":"proceedings-article","created":{"date-parts":[[2019,11,7]],"date-time":"2019-11-07T13:08:32Z","timestamp":1573132112000},"page":"851-868","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A High-Assurance Evaluator for Machine-Checked Secure Multiparty Computation"],"prefix":"10.1145","author":[{"given":"Karim","family":"Eldefrawy","sequence":"first","affiliation":[{"name":"SRI International, Menlo Park, CA, USA"}]},{"given":"Vitor","family":"Pereira","sequence":"additional","affiliation":[{"name":"INESC TEC & FC Universidade do Porto, Porto, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2019,11,6]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Advances in Cryptology -- CRYPTO 2004 ,","author":"Abe Masayuki"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13389-013-0057-3"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-52993-5_9"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134017"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2018.00017"},{"key":"e_1_3_2_2_7_1","volume-title":"Advances in Cryptology -- ASIACRYPT 2011 ,","author":"Backes Michael"},{"key":"e_1_3_2_2_8_1","unstructured":"Michael Backes Matteo Maffei and Esfandiar Mohammadi. 2010. Computationally Sound Abstraction and Verification of Secure Multi-Party Computations. In FSTTCS .  Michael Backes Matteo Maffei and Esfandiar Mohammadi. 2010. Computationally Sound Abstraction and Verification of Secure Multi-Party Computations. In FSTTCS ."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2018.00014"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Joshua Baron Karim Eldefrawy Joshua Lampkins and Rafail Ostrovsky. 2014. How to withstand mobile virus attacks revisited. In PODC. ACM 293--302.  Joshua Baron Karim Eldefrawy Joshua Lampkins and Rafail Ostrovsky. 2014. How to withstand mobile virus attacks revisited. In PODC. ACM 293--302.","DOI":"10.1145\/2611462.2611474"},{"key":"e_1_3_2_2_11_1","volume-title":"Communication-Optimal Proactive Secret Sharing for Dynamic Groups","author":"Baron Joshua"},{"key":"e_1_3_2_2_12_1","volume-title":"ACNS (LNCS)","author":"Baron Joshua"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Gilles Barthe C\u00e9dric Fournet Benjamin Gr\u00e9goire Pierre-Yves Strub Nikhil Swamy and Santiago Zanella-B\u00e9guelin. 2014. Probabilistic Relational Verification for Cryptographic Implementations. In POPL . To appear.  Gilles Barthe C\u00e9dric Fournet Benjamin Gr\u00e9goire Pierre-Yves Strub Nikhil Swamy and Santiago Zanella-B\u00e9guelin. 2014. Probabilistic Relational Verification for Cryptographic Implementations. In POPL . To appear.","DOI":"10.1145\/2535838.2535847"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455804"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. ACM 1--10.  Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. ACM 1--10.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"crossref","volume-title":"Implementing TLS with Verified Cryptographic Security","author":"Bhargavan Karthikeyan","DOI":"10.1109\/SP.2013.37"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MARK.1979.8817296"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2014.21"},{"key":"e_1_3_2_2_21_1","volume-title":"Sharemind: A Framework for Fast Privacy-Preserving Computations. In ESORICS (Lecture Notes in Computer Science)","author":"Bogdanov Dan","year":"2008"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Sally Browning and Philip Weaver. 2010. Designing Tunable Verifiable Cryptographic Hardware Using Cryptol . 89--143. https:\/\/doi.org\/10.1007\/978--1--4419--1539--9_4  Sally Browning and Philip Weaver. 2010. Designing Tunable Verifiable Cryptographic Hardware Using Cryptol . 89--143. https:\/\/doi.org\/10.1007\/978--1--4419--1539--9_4","DOI":"10.1007\/978-1-4419-1539-9_4"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/586110.586124"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.64"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2018.00029"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Morten Dahl and Ivan Damg\u00e5rd. 2014. Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption. In EUROCRYPT .  Morten Dahl and Ivan Damg\u00e5rd. 2014. Universally Composable Symbolic Analysis for Two-Party Protocols Based on Homomorphic Encryption. In EUROCRYPT .","DOI":"10.1007\/978-3-642-55220-5_38"},{"key":"e_1_3_2_2_28_1","volume-title":"Proceedings of the 20th International Conference on Financial Cryptography and Data Security . Springer, 169--187","author":"Damg\u00e5rd Ivan","year":"2016"},{"key":"e_1_3_2_2_29_1","volume-title":"ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation. In 22nd Annual Network and Distributed System Security Symposium, NDSS 2015","author":"Demmler Daniel","year":"2015"},{"key":"e_1_3_2_2_30_1","volume-title":"Security and Cryptography for Networks","author":"Dolev Shlomi"},{"key":"e_1_3_2_2_31_1","volume-title":"SCN (LNCS)","author":"Dolev Shlomi"},{"key":"e_1_3_2_2_32_1","volume-title":"SCAPI: The Secure Computation Application Programming Interface. Cryptology ePrint Archive, Report 2012\/629. https:\/\/eprint.iacr.org\/2012\/629.","author":"Ejgenberg Yael","year":"2012"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98113-0_11"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1987.4"},{"key":"e_1_3_2_2_36_1","volume-title":"One Logic To Use Them All. In 24th International Conference on Automated Deduction (CADE-24)","volume":"7898","author":"Filli\u00e2tre Jean-Christophe","year":"2013"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_8"},{"key":"e_1_3_2_2_38_1","volume-title":"Theory of Cryptography ,","author":"Fitzi Matthias"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"C\u00e9dric Fournet Markulf Kohlweiss and Pierre-Yves Strub. 2011. Modular code-based cryptographic verification. In ACM CCS .  C\u00e9dric Fournet Markulf Kohlweiss and Pierre-Yves Strub. 2011. Modular code-based cryptographic verification. In ACM CCS .","DOI":"10.1145\/2046707.2046746"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129780"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380853"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277716"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC. 218--229.  Oded Goldreich Silvio Micali and Avi Wigderson. 1987. How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. In STOC. 218--229.","DOI":"10.1145\/28395.28420"},{"key":"e_1_3_2_2_44_1","volume-title":"Computer-Aided Proofs for Multiparty Computation with Active Security. In 31st IEEE Computer Security Foundations Symposium, CSF 2018","author":"Haagh Helene","year":"2018"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Helene Haagh Aleksandr Karbyshev Sabine Oechsner Bas Spitters and Pierre-Yves Strub. 2018b. Computer-Aided Proofs for Multiparty Computation with Active Security. 119--131. https:\/\/doi.org\/10.1109\/CSF.2018.00016  Helene Haagh Aleksandr Karbyshev Sabine Oechsner Bas Spitters and Pierre-Yves Strub. 2018b. Computer-Aided Proofs for Multiparty Computation with Active Security. 119--131. https:\/\/doi.org\/10.1109\/CSF.2018.00016","DOI":"10.1109\/CSF.2018.00016"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"e_1_3_2_2_47_1","first-page":"451","article-title":"TASTY: Tool for Automating Secure Two-partY computations","volume":"2010","author":"Henecka Wilko","year":"2010","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"crossref","unstructured":"Amir Herzberg Stanislaw Jarecki Hugo Krawczyk and Moti Yung. 1995 a. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. In CRYPTO . 339--352.  Amir Herzberg Stanislaw Jarecki Hugo Krawczyk and Moti Yung. 1995 a. Proactive Secret Sharing Or: How to Cope With Perpetual Leakage. In CRYPTO . 339--352.","DOI":"10.1007\/3-540-44750-4_27"},{"key":"e_1_3_2_2_49_1","volume-title":"Advances in Cryptology -- CRYPT0' 95","author":"Herzberg Amir"},{"key":"e_1_3_2_2_50_1","volume-title":"CRYPTO (2) (LNCS)","author":"Hirt Martin"},{"key":"e_1_3_2_2_51_1","volume-title":"Improving the Round Complexity of VSS in Point-to-Point Networks","author":"Katz Jonathan"},{"key":"e_1_3_2_2_52_1","volume-title":"Advances in Cryptology -- CRYPTO 2001 ,","author":"Krawczyk Hugo"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_25"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"crossref","unstructured":"Baiyu Li and Daniele Micciancio. 2018. Symbolic Security of Garbled Circuits. 147--161. https:\/\/doi.org\/10.1109\/CSF.2018.00018  Baiyu Li and Daniele Micciancio. 2018. Symbolic Security of Garbled Circuits. 147--161. https:\/\/doi.org\/10.1109\/CSF.2018.00018","DOI":"10.1109\/CSF.2018.00018"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251375.1251395"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.03.020"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"crossref","unstructured":"Rafail Ostrovsky and Moti Yung. 1991. How to Withstand Mobile Virus Attacks (Extended Abstract). In PODC. ACM 51--59.  Rafail Ostrovsky and Moti Yung. 1991. How to Withstand Mobile Virus Attacks (Extended Abstract). In PODC. ACM 51--59.","DOI":"10.1145\/112600.112605"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_29"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754868.1754929"},{"key":"e_1_3_2_2_61_1","volume-title":"Advances in Cryptology -- CRYPTO '91","author":"Pedersen Torben Pryds"},{"key":"e_1_3_2_2_62_1","volume-title":"A Verified Language Extension for Secure Multi-party Computations. CoRR","author":"Rastogi Aseem","year":"2017"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_66_1","volume-title":"Information-Theoretic Security of Cryptographic Protocols in the Random Oracle Model. In 30th IEEE Computer Security Foundations Symposium, CSF 2017","author":"Stoughton Alley","year":"2017"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56617-7_14"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133979"},{"key":"e_1_3_2_2_69_1","volume-title":"Verifiable Secret Redistribution for Archive System. In IEEE Security in Storage Workshop . IEEE Computer Society, 94--106","author":"Wong Theodore M."},{"key":"e_1_3_2_2_70_1","volume-title":"Protocols for Secure Computations (Extended Abstract)","author":"Chi-Chih Yao Andrew"},{"key":"e_1_3_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/1085126.1085127"}],"event":{"name":"CCS '19: 2019 ACM SIGSAC Conference on Computer and Communications Security","location":"London United Kingdom","acronym":"CCS '19","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3319535.3354205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:24:02Z","timestamp":1750202642000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3319535.3354205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,6]]},"references-count":66,"alternative-id":["10.1145\/3319535.3354205","10.1145\/3319535"],"URL":"https:\/\/doi.org\/10.1145\/3319535.3354205","relation":{},"subject":[],"published":{"date-parts":[[2019,11,6]]},"assertion":[{"value":"2019-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}