Telechat Review of draft-baeuerle-netnews-cancel-lock-06
review-baeuerle-netnews-cancel-lock-06-opsdir-telechat-jaeggli-2017-10-06-00
Request | Review of | draft-baeuerle-netnews-cancel-lock |
---|---|---|
Requested revision | No specific revision (document currently at 09) | |
Type | Telechat Review | |
Team | Ops Directorate (opsdir) | |
Deadline | 2017-09-26 | |
Requested | 2017-09-13 | |
Authors | Michael Bäuerle | |
I-D last updated | 2017-10-06 | |
Completed reviews |
Genart Last Call review of -05
by Paul Kyzivat
(diff)
Secdir Last Call review of -05 by David Mandelberg (diff) Genart Telechat review of -06 by Paul Kyzivat (diff) Secdir Telechat review of -06 by David Mandelberg (diff) Opsdir Telechat review of -06 by Joel Jaeggli (diff) |
|
Assignment | Reviewer | Joel Jaeggli |
State | Completed | |
Request | Telechat review on draft-baeuerle-netnews-cancel-lock by Ops Directorate Assigned | |
Reviewed revision | 06 (document currently at 09) | |
Result | Has nits | |
Completed | 2017-10-06 |
review-baeuerle-netnews-cancel-lock-06-opsdir-telechat-jaeggli-2017-10-06-00
I have reviewed draft-baeuerle-netnews-cancel-lock on behalf of the Operations Directorate, for the IESG telechat review. Modula the issues raised in the Genart Review (abnf validation) and security ( pre-image attack protection) I think this is a largely ready to go. Under the best circumstances methods for article cancelation aren't necessarily honored, are intended to be employed by a diverse group of end users injecting netnews agents, or moderators, asserting various roles in managing message removal and offer somewhere between poor to no assurance of efficacy. To the extent that this methodology offers an improvement to the set of parties that chose to both employ it and honor it; it offers protection against spurious removal requests from within the scope of their systems. the protections offered by the MUST NOT in section 3.2 are weak as the message has no integrity protection of substance and any such assurance that demand is honored is a coordination problem between like-minded operators.