- Link
- Affiliation: UC Berkley
- Year: 2022
- Authors
- Emma Dauterman
- Vivian Fang
- Natacha Crooks
- Raluca Ada Popa
Notes
- Fundamentally this paper attempts to address Byzantine conditions via observability
- Also assumes that someone will audit the log
- Feels like similar tradeoffs to optimistic verification
- e.g. depends on deterministic reproducibility
- Heavy emphasis on [append-only log]s, but I think thereβs only a need for βaβ persistent data structure
- Their approach does not guard against buggy code, only malicious code
- They saw a roughly 50% increase in processing time moving to the distributed trust environment
- Sandbox: 46%
- TEE + Sandbox: 55%