Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci
{"title":"区块链系统集合累加器综述","authors":"Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci","doi":"10.1016/j.cosrev.2023.100570","DOIUrl":null,"url":null,"abstract":"<div><p>Set accumulators are cryptographic primitives used to represent arbitrarily large sets of elements with a single constant-size value and to efficiently verify whether a value belongs to that set. Accumulators support the generation of membership proofs, meaning that they can certify the presence of a given value among the elements of a set. In this paper we present an overview of the theoretical concepts underlying set accumulators, we compare the most popular constructions from a complexity perspective, and we survey a number of their applications related to blockchain technology. In particular, we focus on four different use cases: query authentication, stateless transactions validation, anonymity enhancement, and identity management. For each of these scenarios, we examine the main problems they introduce and discuss the most relevant accumulator-based solutions proposed in the literature. Finally, we point out the common approaches between the proposals and highlight the currently open problems in each field.</p></div>","PeriodicalId":48633,"journal":{"name":"Computer Science Review","volume":"49 ","pages":"Article 100570"},"PeriodicalIF":13.3000,"publicationDate":"2023-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A survey of set accumulators for blockchain systems\",\"authors\":\"Matteo Loporchio, Anna Bernasconi, Damiano Di Francesco Maesa, Laura Ricci\",\"doi\":\"10.1016/j.cosrev.2023.100570\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Set accumulators are cryptographic primitives used to represent arbitrarily large sets of elements with a single constant-size value and to efficiently verify whether a value belongs to that set. Accumulators support the generation of membership proofs, meaning that they can certify the presence of a given value among the elements of a set. In this paper we present an overview of the theoretical concepts underlying set accumulators, we compare the most popular constructions from a complexity perspective, and we survey a number of their applications related to blockchain technology. In particular, we focus on four different use cases: query authentication, stateless transactions validation, anonymity enhancement, and identity management. For each of these scenarios, we examine the main problems they introduce and discuss the most relevant accumulator-based solutions proposed in the literature. Finally, we point out the common approaches between the proposals and highlight the currently open problems in each field.</p></div>\",\"PeriodicalId\":48633,\"journal\":{\"name\":\"Computer Science Review\",\"volume\":\"49 \",\"pages\":\"Article 100570\"},\"PeriodicalIF\":13.3000,\"publicationDate\":\"2023-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science Review\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1574013723000370\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science Review","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1574013723000370","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
A survey of set accumulators for blockchain systems
Set accumulators are cryptographic primitives used to represent arbitrarily large sets of elements with a single constant-size value and to efficiently verify whether a value belongs to that set. Accumulators support the generation of membership proofs, meaning that they can certify the presence of a given value among the elements of a set. In this paper we present an overview of the theoretical concepts underlying set accumulators, we compare the most popular constructions from a complexity perspective, and we survey a number of their applications related to blockchain technology. In particular, we focus on four different use cases: query authentication, stateless transactions validation, anonymity enhancement, and identity management. For each of these scenarios, we examine the main problems they introduce and discuss the most relevant accumulator-based solutions proposed in the literature. Finally, we point out the common approaches between the proposals and highlight the currently open problems in each field.
期刊介绍:
Computer Science Review, a publication dedicated to research surveys and expository overviews of open problems in computer science, targets a broad audience within the field seeking comprehensive insights into the latest developments. The journal welcomes articles from various fields as long as their content impacts the advancement of computer science. In particular, articles that review the application of well-known Computer Science methods to other areas are in scope only if these articles advance the fundamental understanding of those methods.