1. A computer-implemented method for improving computer system cryptographic key security, comprising: under the control of one or more computer systems configured with executable instructions, creating a directed acyclic graph representation of a network of a plurality of revocation servers, comprising a plurality of vertices, each vertex of the plurality of vertices representing a corresponding revocation server and a plurality of edges, each edge of the plurality of edges connecting a pair of vertices of the plurality of vertices and representing connectivity between a pair of corresponding revocation servers; performing one or more operations to make the directed acyclic graph k-connected where k is selected to satisfy a constraint on minimum connectivity of the directed acyclic graph; responding to one or more network mutating cryptographic key events by traversing the directed acyclic graph representation to identify one or more of the plurality of revocation servers upon which to perform one or more operations associated with a key event of the one or more network mutating cryptographic key events; and repairing one or more connection failures that result from the responding to the one or more network mutating cryptographic key events, between one or more of the plurality of revocation servers and a target revocation server, by at least: altering the directed acyclic graph representation to establish a new representation of the network that remains k-connected; and establishing new connections between the one or more of the plurality of revocation servers based at least in part on the altered directed acyclic graph representation.