Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | DECO: proving statements about TLS data without a trusted hardware box |
|---|---|
| What the text proposes | DECO proposes that a user prove a fact about a TLS session with a website, to a verifier, without putting the session inside trusted hardware. |
| Who may write | Fan Zhang, Deepak Maram, Harjasleen Malvai, Steven Goldfeder and Ari Juels |
| What is settled | The prover and the verifier jointly participate so the prover cannot splice a fake response, under the paper's construction. |
| Load-bearing assumption | This is a paper. It is not a claim that Chainlink or any product has deployed it unchanged. |
| What this library says afterwards | A reading of the project's public design document. Not a copy, not a benchmark, and not an offer. |
| Rights | Official external source only |