Confidential Computing Proofs
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.
Authors
- Greg Zaverucha
- Mark Russinovich
- Brandon Murdoch
- Cédric Fournet (ORCID: https://orcid.org/0000-0001-6929-886X)
- Manuel Costa
- Josh Benaloh
Institutions
- Microsoft (United States) (US)
- Microsoft (United Kingdom) (GB)
- Microsoft Research (United Kingdom) (GB)
Publication Details
- Journal
- Queue
- Published
- 2024-08-30
- DOI
- https://doi.org/10.1145/3689949
- Citations
- 3
- Primary Topic
- Cryptography and Data Security
- Type
- article
- Field-Weighted Citation Impact
- 1.04