Abstract
To detect runtime attacks against programs running on a remote computing platform, Control-Flow Attestation (CFA) lets a (trusted) verifier determine the legality of the program’s execution path, as recorded and reported by the remote platform (prover). However, besides complicating scalability due to verifier complexity, this assumption regarding the verifier’s trustworthiness renders existing CFA schemes prone to privacy breaches and implementation disclosure attacks under “honest-but-curious” adversaries. Thus, to suppress sensitive details from the verifier, we propose to have the prover outsource the verification of the attested execution path to an intermediate worker of which the verifier only learns the result. However, since a worker might be dishonest about the outcome of the verification, we propose a purely cryptographical solution of transforming the verification of the attested execution path into a verifiable computational task that can be reliably outsourced to a worker without relying on any trusted execution environment. Specifically, we propose to express a program-agnostic execution path verification task inside an arithmetic circuit whose correct execution can be verified by untrusted verifiers in zero knowledge.
Original language | English |
---|---|
Title of host publication | Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security |
Publisher | ACM |
Publication date | 2023 |
Pages | 357-371 |
ISBN (Electronic) | 979-8-4007-0098-9 |
DOIs | |
Publication status | Published - 2023 |
Event | 2023 ACM ASIA Conference on Computer and Communications Security - Melbourne, Australia Duration: 10 Jul 2023 → 14 Jul 2023 |
Conference
Conference | 2023 ACM ASIA Conference on Computer and Communications Security |
---|---|
Country/Territory | Australia |
City | Melbourne |
Period | 10/07/2023 → 14/07/2023 |
Keywords
- Control-Flow Attestation
- Verifiable Computation
- zkSNARK