{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:53:08Z","timestamp":1768405988884,"version":"3.49.0"},"reference-count":72,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-009"},{"start":{"date-parts":[[2023,5,1]],"date-time":"2023-05-01T00:00:00Z","timestamp":1682899200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-001"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1109\/sp46215.2023.10179397","type":"proceedings-article","created":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T17:18:15Z","timestamp":1689959895000},"page":"848-863","source":"Crossref","is-referenced-by-count":10,"title":["Silph: A Framework for Scalable and Accurate Generation of Hybrid MPC Protocols"],"prefix":"10.1109","author":[{"given":"Edward","family":"Chen","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Jinhao","family":"Zhu","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Alex","family":"Ozdemir","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Riad S.","family":"Wahby","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Fraser","family":"Brown","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Wenting","family":"Zheng","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454074"},{"key":"ref2","article-title":"SCALE-MAMBA","author":"Aly"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3338469.3358945"},{"key":"ref4","article-title":"The SMT-LIB standard: Version 2.0","author":"Barrett","year":"2010","journal-title":"SMT"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"ref6","volume-title":"Circom","author":"Baylina"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100287"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62213"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3310273.3323047"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1145\/2517349.2522733","article-title":"Verifying computations with state","volume-title":"SOSP","author":"Braun","year":"2013"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3490390"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243786"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2732516.2732520"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2019.00043"},{"key":"ref17","article-title":"E3: A framework for compiling c++ programs with encrypted operands","author":"Chielle","year":"2018","journal-title":"Cryptology ePrint Archive"},{"key":"ref18","volume-title":"Leo: A programming language for formally verified, zero-knowledge applications","author":"Chin","year":"2021"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243828"},{"key":"ref22","article-title":"Multiparty computation from somewhat homomorphic encryption","author":"Damg\u00e5ard","year":"2012","journal-title":"CRYPTO"},{"key":"ref23","article-title":"Multiparty computation from somewhat homomorphic encryption","author":"Damg\u00e5ard","year":"2012","journal-title":"CRYPTO"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3386023"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314628"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23113"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/Cybermatics_2018.2018.00199"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP53844.2022.00017"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1287\/educ.1053.0020"},{"key":"ref30","journal-title":"Official Journal of the European Union \u201916"},{"key":"ref31","article-title":"Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy","author":"Gilad-Bachrach","year":"2016","journal-title":"ICML"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54365-8_8"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382278"},{"key":"ref34","article-title":"Faster secure two-party computation using garbled circuits","author":"Huang","year":"2011","journal-title":"USENIX Security"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339818"},{"key":"ref36","article-title":"Gazelle: A low latency framework for secure neural network inference","author":"Juvekar","year":"2018","journal-title":"USENIX Security"},{"key":"ref37","article-title":"Kahip - karlsruhe high quality partitioning"},{"key":"ref38","article-title":"Kahypar - karlsruhe hypergraph partitioning"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSPW54576.2021.00048"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978357"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78372-7_6"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00018"},{"key":"ref43","article-title":"Muse: Secure inference resilient to malicious clients","author":"Lehmkuhl","year":"2021","journal-title":"USENIX Security"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-019-09322-2"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/memb.2007.364946"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134056"},{"key":"ref48","article-title":"Fairplay-secure two-party computation system","author":"Malkhi","year":"2004","journal-title":"USENIX Security"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3411501.3419418"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.12"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_40"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/roman.2004.1374848"},{"key":"ref54","article-title":"Experimenting with collaborative zk-snarks: Zero-knowledge proofs for distributed secrets","author":"Ozdemir","year":"2022","journal-title":"USENIX Security"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833782"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref57","first-page":"2165","article-title":"{ABY2. 0}: Improved {Mixed-Protocol} secure {Two-Party} computation","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Patra"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.48"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196522"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"ref61","article-title":"High-Quality Hypergraph Partitioning","volume-title":"PhD thesis","author":"Schlag","year":"2020"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39555-5_19"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"ref64","article-title":"Taking proof-based verified computation a few steps closer to practicality","volume-title":"USENIX Security","author":"Setty","year":"2012"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/2666356.2594340"},{"key":"ref66","article-title":"Sealion: A framework for neural network inference on encrypted data","author":"Van Elsloo","year":"2019"},{"key":"ref67","article-title":"HECO: Automatic code optimizations for efficient fully homomorphic encryption","author":"Viand","year":"2022"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00068"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3267973.3267978"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133979"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.25"},{"key":"ref73","article-title":"Obliv-C: A language for extensible data-oblivious computation","author":"Zahur","year":"2015"},{"key":"ref74","article-title":"Cerebro: A platform for {Multi-Party} cryptographic collaborative learning","author":"Zheng","year":"2021","journal-title":"USENIX Security"}],"event":{"name":"2023 IEEE Symposium on Security and Privacy (SP)","location":"San Francisco, CA, USA","start":{"date-parts":[[2023,5,21]]},"end":{"date-parts":[[2023,5,25]]}},"container-title":["2023 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10179215\/10179280\/10179397.pdf?arnumber=10179397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T05:16:34Z","timestamp":1721452594000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10179397\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":72,"URL":"https:\/\/doi.org\/10.1109\/sp46215.2023.10179397","relation":{},"subject":[],"published":{"date-parts":[[2023,5]]}}}