Welcome to the resource topic for 2021/627
Title:
Client-Auditable Verifiable Registries
Authors: Nirvan Tyagi, Ben Fisch, Joseph Bonneau, Stefano Tessaro
Abstract:Verifiable registries allow clients to securely access a key-value mapping maintained by an untrusted server. Applications include distribution of public keys, routing information or software binaries. Existing proposals for verifiable registries rely on global invariants being audited whenever the registry is updated. Clients typically rely on trusted third-party auditors, as large registries become expensive to audit. We propose several new protocols for client-auditable registries that enable efficient verification of many updates to the registry, removing the need for third-party auditors. Our solutions use incrementally-verifiable computation (IVC) and/or RSA accumulators. Our evaluation shows that our constructions meet practical throughput requirements (60 updates / second), which is 100\times faster than naive solutions using IVC. Clients save 100–10^4\times bandwidth and computation costs over prior solutions requiring auditing every update.
ePrint: https://eprint.iacr.org/2021/627
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .