Transparency systems such as Key Transparency, Certificate Transparency, and binary transparency depend on a critical property: every honest participant must see the same view of an untrusted server's directory. If the server presents different versions to different users, the system fails. The new paper introduces Fortress, a design that aims to make such logs fork-resistant by exploiting social graph structure.
According to the abstract, Fortress relies on the relationships between participants to detect or prevent forks, rather than assuming the server will behave honestly. The abstract is truncated, so the full technical details are not available, but the core idea is that social connections can serve as a consistency check across the network.
The paper does not claim to replace existing transparency mechanisms; instead, it offers a complementary approach that uses social graph topology as a source of resilience. Further details on the construction and security guarantees would require reading the full manuscript.