{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,23]],"date-time":"2025-12-23T00:29:18Z","timestamp":1766449758123,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["1909769"],"award-info":[{"award-number":["1909769"]}]},{"name":"Sandia National Laboratories","award":["DE-NA-0003525"],"award-info":[{"award-number":["DE-NA-0003525"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417283","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T18:27:02Z","timestamp":1604341622000},"page":"2055-2074","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["A 2.1 KHz Zero-Knowledge Processor with BubbleRAM"],"prefix":"10.1145","author":[{"given":"David","family":"Heath","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]},{"given":"Vladimir","family":"Kolesnikov","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"volume-title":"Garbling Gadgets for Boolean and Arithmetic Circuits. In ACM CCS 2016 , , Edgar R. Weippl, Stefan Katzenbeisser, Christopher Kruegel, Andrew C. Myers, and Shai Halevi (Eds.). ACM Press, 565--577","year":"2016","author":"Ball Marshall","key":"e_1_3_2_2_2_1"},{"volume-title":"CRYPTO'92 (LNCS ), , Ernest F","author":"Bellare Mihir","key":"e_1_3_2_2_3_1"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382279"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"volume-title":"Ward","year":"2019","author":"Ben-Sasson Eli","key":"e_1_3_2_2_8_1"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_16"},{"volume-title":"USENIX Security 2014 ,","author":"Ben-Sasson Eli","key":"e_1_3_2_2_11_1"},{"volume-title":"Bulletproofs: Short Proofs for Confidential Transactions and More. In 2018 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 315--334","year":"2018","author":"B\u00fcnz Benedikt","key":"e_1_3_2_2_12_1"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133997"},{"volume-title":"Geppetto: Versatile Verifiable Computation. In 2015 IEEE Symposium on Security and Privacy . IEEE Computer Society Press, 253--270","year":"2015","author":"Costello Craig","key":"e_1_3_2_2_14_1"},{"volume-title":"CRYPTO'94 (LNCS )","author":"Cramer Ronald","key":"e_1_3_2_2_15_1"},{"volume-title":"33rd FOCS","year":"1992","author":"Santis Alfredo De","key":"e_1_3_2_2_16_1"},{"volume-title":"Scaling ORAM for Secure Computation. In ACM CCS 2017 , , Bhavani M. Thuraisingham, David Evans, Tal Malkin, and Dongyan Xu (Eds.). ACM Press, 523--535","author":"Jack","key":"e_1_3_2_2_17_1"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46803-6_7"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"volume-title":"USENIX Security 2016 ,","author":"Giacomelli Irene","key":"e_1_3_2_2_20_1"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"volume-title":"17th","author":"Goldwasser Shafi","key":"e_1_3_2_2_22_1"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_8"},{"volume-title":"David S. Johnson and Uriel Feige (Eds.)","author":"Ishai Yuval","key":"e_1_3_2_2_26_1"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516662"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243805"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70583-3_40"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85230-8_7"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_42"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_18"},{"volume-title":"Pinocchio: Nearly Practical Verifiable Computation. In 2013 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 238--252","year":"2013","author":"Parno Bryan","key":"e_1_3_2_2_34_1"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34621-8_19"},{"volume-title":"CRYPTO'89 (LNCS )","author":"Schnorr Claus-Peter","key":"e_1_3_2_2_36_1"},{"volume-title":"TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits. In 2015 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 411--428","year":"2015","author":"Songhori Ebrahim M.","key":"e_1_3_2_2_37_1"},{"key":"e_1_3_2_2_38_1","first-page":"1","article-title":"A Permutation Network","volume":"15","author":"Waksman Abraham","year":"1968","journal-title":"J. ACM"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813634"},{"key":"e_1_3_2_2_40_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016b. EMP-toolkit: Efficient MultiParty computation toolkit . https:\/\/github.com\/emp-toolkit . (2016).  Xiao Wang Alex J. Malozemoff and Jonathan Katz. 2016b. EMP-toolkit: Efficient MultiParty computation toolkit . https:\/\/github.com\/emp-toolkit . (2016)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45741-3_6"},{"volume-title":"Libra: Succinct Zero-Knowledge Proofs with Optimal Prover Computation. In CRYPTO","year":"2019","author":"Xie Tiancheng","key":"e_1_3_2_2_42_1"},{"volume-title":"Revisiting Square-Root ORAM: Efficient Random Access in Multi-party Computation. In 2016 IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 218--234","year":"2016","author":"Zahur Samee","key":"e_1_3_2_2_43_1"}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event USA","acronym":"CCS '20"},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417283","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:31Z","timestamp":1750197691000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":40,"alternative-id":["10.1145\/3372297.3417283","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417283","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}