#159 closed defect (fixed)
Missing step in "Verifying an inclusion proof"
Reported by: | robpercival@… | Owned by: | rob.stradling@… |
---|---|---|---|
Priority: | minor | Milestone: | review |
Component: | rfc6962-bis | Version: | |
Severity: | - | Keywords: | |
Cc: |
Description
In section 10.4.1, the described algorithm is missing a step. Immediately under '4. For each value "p" in the "inclusion_path" array:', it should say 'If "sn" is 0, stop the iteration and fail the proof verification.'. Otherwise, inclusion proofs containing more nodes than necessary (i.e. not "the shortest list of additional nodes") will pass verification.
Change History (5)
comment:1 Changed 6 years ago by rob.stradling@…
comment:2 Changed 6 years ago by paul@…
Please resolve the issue and put a new version of the document out,
comment:3 Changed 6 years ago by rob.stradling@…
- Milestone set to review
- Owner changed from draft-ietf-trans-rfc6962-bis@… to rob.stradling@…
- Status changed from new to assigned
We'll submit an updated draft before the next submission deadline (2016-10-31 UTC 23:59).
comment:4 Changed 6 years ago by melinda.shore@…
- Resolution set to fixed
- Status changed from assigned to closed
comment:5 Changed 6 years ago by rob.stradling@…
Draft -20 submitted.
Note: See
TracTickets for help on using
tickets.
Here's a PR to address this defect report:
https://github.com/google/certificate-transparency-rfcs/pull/199
Chairs,
6962-bis has completed WGLC, so how do we handle this?