This talk presents Aegon, a self-auditable key transparency scheme designed for global-scale encrypted messaging. It builds on Iron Dict's polynomial commitment approach to remove per-epoch global work, shards the dictionary for horizontal scaling, and uses proof caching to bound storage. The result is constant-size audit proofs that a lightweight client can verify itself over an entire history, rather than relying on external auditors.
Hossein Hafezi from NYU presents IronDict, a novel transparent dictionary construction using polynomial commitment schemes. IronDict addresses the major limitations of existing Merkle tree-based systems, such as high auditing costs and imperfect privacy. By modeling the dictionary with polynomials and leveraging the algebraic properties of the KZH commitment scheme, IronDict achieves perfect privacy and dramatically reduces auditing overhead, making it feasible for end-users to verify the system's integrity on consumer devices.