{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T14:19:08Z","timestamp":1772547548788,"version":"3.50.1"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"12","license":[{"start":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T00:00:00Z","timestamp":1732233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2024,12]]},"abstract":"<jats:p>Trade-offs between secure computation via cryptography and hardware enclaves.<\/jats:p>","DOI":"10.1145\/3677616","type":"journal-article","created":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T21:16:31Z","timestamp":1730754991000},"page":"44-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Confidential Computing or Cryptographic Computing?"],"prefix":"10.1145","volume":"67","author":[{"given":"Raluca Ada","family":"Popa","sequence":"first","affiliation":[{"name":"University of California, Berkeley, Berkeley, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,11,22]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"Anjuna. Confidential computing pioneer Anjuna makes cloud safe enough for even government and defense agencies (2022); https:\/\/bit.ly\/4bCFAF1."},{"key":"e_1_3_1_3_2","unstructured":"Confidential Computing Consortium; https:\/\/confidentialcomputing.io."},{"key":"e_1_3_1_4_2","unstructured":"Confidential Computing Summit 2024; https:\/\/www.confidentialcomputingsummit.com."},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Dauterman E. et al. Snoopy: surpassing the scalability bottleneck of oblivious storage. In Proceedings of the ACM SIGOPS 28th Symp. on Operating Systems Principles (2021); 10.1145\/3477132.3483562.","DOI":"10.1145\/3477132.3483562"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/3623460"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/3623393.3623391"},{"key":"e_1_3_1_8_2","unstructured":"Galois. Galois team wraps up the Jana project (2020); https:\/\/bit.ly\/46179a7."},{"key":"e_1_3_1_9_2","unstructured":"Galois. Jana: Private data as a service (2024); https:\/\/bit.ly\/3LgGMTZ"},{"key":"e_1_3_1_10_2","volume-title":"Ph.D. dissertation","author":"Gentry C.","year":"2009","unstructured":"Gentry, C. A fully homomorphic encryption scheme. Ph.D. dissertation, Stanford University (2009); https:\/\/crypto.stanford.edu\/craig\/craig-thesis.pdf."},{"key":"e_1_3_1_11_2","unstructured":"Google Cloud. Confidential VM overview; https:\/\/bit.ly\/3xR0dzz."},{"key":"e_1_3_1_12_2","unstructured":"Google Cloud. Encrypt workload data in-use with confidential Google Kubernetes engine nodes; https:\/\/bit.ly\/3XXeqpp."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3623392"},{"key":"e_1_3_1_14_2","unstructured":"Kumar S. Culler D.E. and Popa R.A. MAGE: nearly zero-cost virtual memory for secure computation.In Proceedings of the Usenix Symp. on Operating Systems Design and Implementation; https:\/\/bit.ly\/45Wk78Z."},{"key":"e_1_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Mishra P. et al. Oblix: an efficient oblivious search index. In Proceedings of the IEEE Symp. on Security and Privacy (2018) 279\u2013297; https:\/\/people.eecs.berkeley.edu\/~raluca\/oblix.pdf.","DOI":"10.1109\/SP.2018.00045"},{"key":"e_1_3_1_16_2","unstructured":"MPC Deployments; https:\/\/mpc.cs.berkeley.edu."},{"key":"e_1_3_1_17_2","unstructured":"Nvidia Confidential Computing; https:\/\/bit.ly\/3xFdDyI."},{"key":"e_1_3_1_18_2","unstructured":"Opaque; https:\/\/opaque.co."},{"key":"e_1_3_1_19_2","unstructured":"Poddar R. et al. Senate: A maliciously secure MPC platform for collaborative analytics. In Proceedings of the 30th Usenix Security Symp. (2021); https:\/\/bit.ly\/4cUrkIL."},{"key":"e_1_3_1_20_2","unstructured":"RISELab; https:\/\/rise.cs.berkeley.edu."},{"key":"e_1_3_1_21_2","unstructured":"SecureValueRecovery2. Github; https:\/\/bit.ly\/3VX4ERw."},{"key":"e_1_3_1_22_2","unstructured":"Signal; https:\/\/signal.org\/blog\/building-faster-oram\/."},{"key":"e_1_3_1_23_2","unstructured":"Watson J.-L. Wagh S. and Popa R.A. Piranha: A GPU platform for secure computation. In Proceedings of the 31st Usenix Security Symp. (2022); https:\/\/www.usenix.org\/system\/files\/sec22-watson.pdf."},{"key":"e_1_3_1_24_2","doi-asserted-by":"crossref","unstructured":"Yao A.C.-C. How to generate and exchange secrets. In Proceedings of the 27th Annual Symp. on Foundations of Computer Science (1986) 162\u2013167; https:\/\/ieeexplore.ieee.org\/document\/4568207.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677616","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3677616","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:58:30Z","timestamp":1750294710000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,22]]},"references-count":23,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1145\/3677616"],"URL":"https:\/\/doi.org\/10.1145\/3677616","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,22]]},"assertion":[{"value":"2024-11-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}