{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:16:44Z","timestamp":1763968604549,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T00:00:00Z","timestamp":1724976000000},"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":["Queue"],"published-print":{"date-parts":[[2024,8,30]]},"abstract":"<jats:p>Proofs are powerful tools for integrity and privacy, enabling the verifier to delegate a computation and still verify its correct execution, and enabling the prover to keep the details of the computation private. Both CCP and ZKP can achieve soundness and zero-knowledge but with important differences. CCP relies on hardware trust assumptions, which yield high performance and additional confidentiality protection for the prover but may be unacceptable for some applications. CCP is also often easier to use, notably with existing code, whereas ZKP comes with a large prover overhead that may be unpractical for some applications.<\/jats:p>","DOI":"10.1145\/3689949","type":"journal-article","created":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:23:02Z","timestamp":1726071782000},"page":"73-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Confidential Computing Proofs"],"prefix":"10.1145","volume":"22","author":[{"given":"Mark","family":"Russinovich","sequence":"first","affiliation":[{"name":"Microsoft Azure"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Fournet","sequence":"additional","affiliation":[{"name":"Azure Research at Microsoft, Cambridge UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greg","family":"Zaverucha","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josh","family":"Benaloh","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brandon","family":"Murdoch","sequence":"additional","affiliation":[{"name":"Microsoft Security division, London, UK"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Costa","sequence":"additional","affiliation":[{"name":"Microsoft"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,9,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.22"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Delignat-Lavaud A. Fournet C. Vaswani K. Clebsch S. Riechert M. Costa M. Russinovich M. 2023. Why should I trust your code? Communications of the ACM 67 (1) 68?76; https:\/\/dl.acm.org\/doi\/10.1145\/3624578.","DOI":"10.1145\/3624578"},{"key":"e_1_2_1_3_1","volume-title":"zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs","author":"Ernstberger J.","year":"2023","unstructured":"Ernstberger, J., Chaliasos, S., Kadianakis, G., Steinhorst, S., Jovanovic, P., Gervais, A., Livshits, B., Orr\u00f9, M. 2023. zk-Bench: a toolset for comparative evaluation and performance benchmarking of SNARKs; https:\/\/eprint.iacr.org\/2023\/1503.pdf."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of Advances in Cryptology (CRYPTO), 186?194; https:\/\/dl.acm.org\/doi\/10","author":"Fiat A.","year":"1986","unstructured":"Fiat, A., Shamir, A. 1986. How to prove yourself: practical solutions to identification and signature problems. In Proceedings of Advances in Cryptology (CRYPTO), 186?194; https:\/\/dl.acm.org\/doi\/10.5555\/36664.36676."},{"volume-title":"Foundations of Cryptography, Volume 1: Basic Tools","author":"Goldreich O.","key":"e_1_2_1_5_1","unstructured":"Goldreich, O. 2001. Foundations of Cryptography, Volume 1: Basic Tools. Cambridge University Press."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22178"},{"key":"e_1_2_1_7_1","unstructured":"High Assurance Cryptographic Library ? HACL* and EverCrypt Manual; https:\/\/hacl-star.github.io."},{"key":"e_1_2_1_8_1","unstructured":"Intel. 2021. Intel Enhanced Privacy ID (EPID) Security Technology; https:\/\/www.intel.com\/content\/www\/us\/en\/developer\/articles\/technical\/intel-enhanced-privacy-id-epid-security-technology.html."},{"key":"e_1_2_1_9_1","unstructured":"ISO. 2021. ISO\/IEC 18013-5:2021 ? Personal identification ? ISO-compliant driving license; https:\/\/www.iso.org\/standard\/69084.html."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_13"},{"volume-title":"Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 275?289; https:\/\/dl.acm.org\/doi\/10","author":"Ni H.","key":"e_1_2_1_11_1","unstructured":"Ni, H., Delignat-Lavaud, A. Fournet, C., Ramananandro, T., Swamy, N. ASN1*: Provably correct, non-malleable parsing for ASN.1 DER. In Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs, 275?289; https:\/\/dl.acm.org\/doi\/10.1145\/3573105.3575684."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.10"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Walfish M. Blumberg A. J. 2015. Verifying computations without reexecuting them: from theoretical possibility to near practicality. Communications of the ACM 58 (2) 74?84; https:\/\/dl.acm.org\/doi\/10.1145\/2641562.","DOI":"10.1145\/2641562"}],"container-title":["Queue"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689949","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3689949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:32Z","timestamp":1750295852000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3689949"}},"subtitle":["An alternative to cryptographic zero-knowledge"],"short-title":[],"issued":{"date-parts":[[2024,8,30]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,8,30]]}},"alternative-id":["10.1145\/3689949"],"URL":"https:\/\/doi.org\/10.1145\/3689949","relation":{},"ISSN":["1542-7730","1542-7749"],"issn-type":[{"type":"print","value":"1542-7730"},{"type":"electronic","value":"1542-7749"}],"subject":[],"published":{"date-parts":[[2024,8,30]]},"assertion":[{"value":"2024-09-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}