Paper 2023/1208 Original: eprint.iacr.org/2023/1208 ↗
Mutator Sets and their Application to Scalable Privacy
Abstract
A mutator set is a cryptographic data structure for authenticating operations on a changing set of data elements called items. Informally: - There is a short commitment to the set. - There are succinct membership proofs for elements of the set. - It is possible to update the commitment as well as the membership proofs with minimal effort as new items are added to the set or as existing items are removed from it. - Items cannot be removed before they were added. - It is difficult to link an item's addition to the set to its removal from the set, except when using information available only to the party that generated it. This paper formally defines the notion, motivates its existence with an application to scalable privacy in the context of cryptocurrencies, and proposes an instantiation inspired by Merkle mountain ranges and Bloom filters.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2023-08-09: last updated
- 2023-08-09: published
- Short URL
- https://ia.cr/2023/1208
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2023/1208,
author = {Alan Szepieniec and Thorkil Værge},
title = {Mutator Sets and their Application to Scalable Privacy},
howpublished = {Cryptology {ePrint} Archive, Paper 2023/1208},
year = {2023},
url = {https://eprint.iacr.org/2023/1208}
}