#159: Missing step in "Verifying an inclusion proof" 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.
-- -------------------------+------------------------------------------------- Reporter: | Owner: draft-ietf-trans- [email protected] | [email protected] Type: defect | Status: new Priority: minor | Milestone: Component: rfc6962-bis | Version: Severity: - | Keywords: -------------------------+------------------------------------------------- Ticket URL: <https://trac.tools.ietf.org/wg/trans/trac/ticket/159> trans <https://tools.ietf.org/trans/> _______________________________________________ Trans mailing list [email protected] https://www.ietf.org/mailman/listinfo/trans
