I-D Action: draft-reilly-plants-bulk-subtree-proofs-01.txt

Internet-Draft draft-reilly-plants-bulk-subtree-proofs-01.txt is now
available.

   Title:   Bulk Subtree Consistency Proofs for Merkle Tree Certificates
   Author:  Lawrence J. Reilly
   Name:    draft-reilly-plants-bulk-subtree-proofs-01.txt
   Pages:   12
   Dates:   2026-07-27

Abstract:

   Merkle Tree Certificates require relying parties to periodically
   obtain a set of active landmark subtrees and verify each is
   consistent with a reference checkpoint of the issuance log.  As
   specified, this requires one subtree consistency proof per landmark
   subtree, and those proofs share a large fraction of their interior
   nodes.

   This document defines a bulk subtree consistency proof, which
   verifies an entire set of landmark subtrees against a single
   reference checkpoint from one shared set of hashes.  It is a size
   optimization for the relying party update channel and introduces no
   change to certificate verification or to the security properties of
   Merkle Tree Certificates.

   This revision replaces the construction published in -00, which was
   incorrect.  See Appendix "Changes from -00".

The IETF datatracker status page for this Internet-Draft is:
https://datatracker.ietf.org/doc/draft-reilly-plants-bulk-subtree-proofs/

There is also an HTMLized version available at:
https://datatracker.ietf.org/doc/html/draft-reilly-plants-bulk-subtree-proofs-01

A diff from the previous version is available at:
https://author-tools.ietf.org/iddiff?url2=draft-reilly-plants-bulk-subtree-proofs-01

Internet-Drafts are also available by rsync at:
rsync.ietf.org::internet-drafts


_______________________________________________
I-D-Announce mailing list -- [email protected]
To unsubscribe send an email to [email protected]