IronDict: Transparent Dictionaries from Polynomial Commitments

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.