Gossiping in CT
draft-ietf-trans-gossip-03
| Document | Type |
This is an older version of an Internet-Draft whose latest revision state is "Expired".
Expired & archived
|
|
|---|---|---|---|
| Authors | Linus Nordberg , Daniel Kahn Gillmor , Tom Ritter | ||
| Last updated | 2017-01-09 (Latest revision 2016-07-08) | ||
| Replaces | draft-linus-trans-gossip-ct | ||
| RFC stream | Internet Engineering Task Force (IETF) | ||
| Formats | |||
| Additional resources | Mailing list discussion | ||
| Stream | WG state | WG Document | |
| Document shepherd | (None) | ||
| IESG | IESG state | Expired | |
| Consensus boilerplate | Unknown | ||
| Telechat date | (None) | ||
| Responsible AD | (None) | ||
| Send notices to | (None) |
This Internet-Draft is no longer active. A copy of the expired Internet-Draft is available in these formats:
Abstract
The logs in Certificate Transparency are untrusted in the sense that the users of the system don't have to trust that they behave correctly since the behavior of a log can be verified to be correct. This document tries to solve the problem with logs presenting a "split view" of their operations. It describes three gossiping mechanisms for Certificate Transparency: SCT Feedback, STH Pollination and Trusted Auditor Relationship.
Authors
Linus Nordberg
Daniel Kahn Gillmor
Tom Ritter
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)