{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T16:02:53Z","timestamp":1783008173839,"version":"3.54.5"},"reference-count":89,"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.10179345","type":"proceedings-article","created":{"date-parts":[[2023,7,21]],"date-time":"2023-07-21T17:18:15Z","timestamp":1689959895000},"page":"515-533","source":"Crossref","is-referenced-by-count":24,"title":["FLUTE: Fast and Secure Lookup Table Evaluations"],"prefix":"10.1109","author":[{"given":"Andreas","family":"Br\u00fcggemann","sequence":"first","affiliation":[{"name":"Technical University of Darmstadt,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robin","family":"Hundt","sequence":"additional","affiliation":[{"name":"Technical University of Darmstadt,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"Schneider","sequence":"additional","affiliation":[{"name":"Technical University of Darmstadt,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ajith","family":"Suresh","sequence":"additional","affiliation":[{"name":"Technical University of Darmstadt,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hossein","family":"Yalame","sequence":"additional","affiliation":[{"name":"Technical University of Darmstadt,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Berkeley Logic Synthesis. ABC: A System for Sequential Synthesis and Verification","year":"2010"},{"key":"ref2","article-title":"Synopsys Inc. Design Compiler","year":"2010"},{"key":"ref3","article-title":"Synopsys Inc. DesignWare Library - Datapath and Building Block IP","year":"2015"},{"key":"ref4","article-title":"Rust Programming Language v1.65.0","year":"2022"},{"key":"ref5","article-title":"A Survey on Homomorphic Encryption Schemes: Theory and Implementation","author":"Acar","year":"2018","journal-title":"ACM Comput. Surv."},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516738"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-95312-6_5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_34"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44750-4_8"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237996"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-21568-2_26"},{"key":"ref12","article-title":"ScionFL: Secure Quantized Aggregation for Federated Learning","volume-title":"CoRR","volume":"abs\/2210.07376","author":"Ben-Itzhak","year":"2022"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3411501.3419425"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30436-1_24"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354255"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_15"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243786"},{"key":"ref21","article-title":"FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning","author":"Byali","year":"2020","journal-title":"PETS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3338466.3358922"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.23005"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-12164-7"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84252-9_17"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54970-4_10"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_6"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_38"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31517-1_13"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813678"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23097"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/5666.5673"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54807-9_15"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71677-8_22"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511721656"},{"key":"ref38","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":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_22"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3563497"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1201\/b19694-13"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2021-0068"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-78375-4_5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1866307.1866358"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_34"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2972549"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61204-1_12"},{"key":"ref49","article-title":"Founding Cryptography on Oblivious Transfer","author":"Kilian","year":"1988","journal-title":"STOC"},{"key":"ref50","article-title":"CrypTen: Secure Multi-Party Computation Meets Machine Learning","author":"Knott","year":"2021","journal-title":"NeurIPS"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"ref52","article-title":"SWIFT: Superfast and Robust Privacy-Preserving Machine Learning","author":"Koti","year":"2021","journal-title":"USENIX Security"},{"key":"ref53","doi-asserted-by":"crossref","DOI":"10.1145\/3548606.3563496","article-title":"MPClan: Protocol suite for privacy-conscious computations","author":"Koti","year":"2022"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2022.24058"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9177-x"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_16"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.29"},{"key":"ref59","article-title":"Fairplay - Secure Two-Party Computation System","author":"Malkhi","year":"2004","journal-title":"USENIX Security"},{"key":"ref60","article-title":"HyFL: A Hybrid Approach For Private Federated Learning","volume-title":"CoRR","volume":"abs\/2302.09904","author":"Marx","year":"2023"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/3485832.3485897"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301312"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/S1470-2045(19)30149-4"},{"key":"ref64","article-title":"FLAME: Taming Backdoors in Federated Learning","author":"Nguyen","year":"2022","journal-title":"USENIX Security"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48910-X_16"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2017.23089"},{"key":"ref67","article-title":"ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation","author":"Patra","year":"2021","journal-title":"USENIX Security"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/HOST49136.2021.9702293"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2020.24202"},{"key":"ref70","article-title":"libOTe: An Efficient, Portable, and Easy to Use Oblivious Transfer Library","author":"Peter Rindal"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10366-7_15"},{"key":"ref72","article-title":"Poster: Fast Evaluation of S-boxes in MPC","author":"Pohle","year":"2022","journal-title":"NDSS"},{"key":"ref73","article-title":"How To Exchange Secrets with Oblivious Transfer","volume-title":"Harvard University Technical Report TR-81","author":"Rabin","year":"1981"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833697"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00086"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417274"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-31578-8_19"},{"key":"ref78","article-title":"XONN: XNOR-based Oblivious Deep Neural Network Inference","author":"Riazi","year":"2019","journal-title":"USENIX Security"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_5"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/CVPRW53098.2021.00521"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.32"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1145\/3559613.3563192"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2978817"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134053"},{"key":"ref86","article-title":"Yosys - A Free Verilog Synthesis Suite","volume-title":"Austrian Workshop on Microelectronics","author":"Wolf"},{"key":"ref87","article-title":"Protocols for Secure Computations (Extended Abstract)","author":"Yao","year":"1982","journal-title":"FOCS"},{"key":"ref88","article-title":"How to Generate and Exchange Secrets (Extended Abstract)","author":"Yao","year":"1986","journal-title":"FOCS"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-17143-7_14"}],"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\/10179345.pdf?arnumber=10179345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T05:15:35Z","timestamp":1721452535000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10179345\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5]]},"references-count":89,"URL":"https:\/\/doi.org\/10.1109\/sp46215.2023.10179345","relation":{},"subject":[],"published":{"date-parts":[[2023,5]]}}}