Succinct Zero-Knowledge Batch Proofs for Set Accumulators
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Campanelli, Matteo | - |
dc.contributor.author | Fiore, Dario | - |
dc.contributor.author | Han, Semin | - |
dc.contributor.author | Kim, Jihye | - |
dc.contributor.author | Kolonelos, Dimitris | - |
dc.contributor.author | Oh, Hyunok | - |
dc.date.accessioned | 2023-01-25T09:21:11Z | - |
dc.date.available | 2023-01-25T09:21:11Z | - |
dc.date.created | 2023-01-05 | - |
dc.date.issued | 2022-11 | - |
dc.identifier.issn | 1543-7221 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/182196 | - |
dc.description.abstract | Cryptographic accumulators are a common solution to proving information about a large set S. They allow one to compute a short digest of S and short certificates of some of its basic properties, notably membership of an element. Accumulators also allow one to track set updates: a new accumulator is obtained by inserting/deleting a given element. In this work we consider the problem of generating membership and update proofs for em batches of elements so that we can succinctly prove additional properties of the elements (i.e., proofs are of constant size regardless of the batch size), and we can preserve privacy. Solving this problem would allow obtaining blockchain systems with improved privacy and scalability. The state-of-the-art approach to achieve this goal is to combine accumulators (typically Merkle trees) with zkSNARKs. This solution is however expensive for provers and does not scale for large batches of elements. In particular, there is no scalable solution for proving batch membership proofs when we require zero-knowledge (a standard definition of privacy-preserving protocols). In this work we propose new techniques to efficiently use zkSNARKs with RSA accumulators. We design and implement two main schemes: 1) harisa, which proves batch membership in zero-knowledge; 2) insarisa, which proves batch updates. For batch membership, the prover in harisa is orders of magnitude faster than existing approaches based on Merkle trees (depending on the hash function). For batch updates we get similar cost savings compared to approaches based on Merkle trees; we also improve over the recent solution of Ozdemir et al. [USENIX'20]. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Association for Computing Machinery | - |
dc.title | Succinct Zero-Knowledge Batch Proofs for Set Accumulators | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Oh, Hyunok | - |
dc.identifier.doi | 10.1145/3548606.3560677 | - |
dc.identifier.scopusid | 2-s2.0-85143054775 | - |
dc.identifier.bibliographicCitation | Proceedings of the ACM Conference on Computer and Communications Security, pp.455 - 469 | - |
dc.relation.isPartOf | Proceedings of the ACM Conference on Computer and Communications Security | - |
dc.citation.title | Proceedings of the ACM Conference on Computer and Communications Security | - |
dc.citation.startPage | 455 | - |
dc.citation.endPage | 469 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordPlus | Blockchain | - |
dc.subject.keywordPlus | Forestry | - |
dc.subject.keywordPlus | Privacy-preserving techniques | - |
dc.subject.keywordPlus | Hash functions | - |
dc.subject.keywordPlus | Accumulator | - |
dc.subject.keywordPlus | Batch sizes | - |
dc.subject.keywordPlus | Batch update | - |
dc.subject.keywordPlus | Constant sizes | - |
dc.subject.keywordPlus | CryptoGraphics | - |
dc.subject.keywordPlus | Merkle trees | - |
dc.subject.keywordPlus | Property | - |
dc.subject.keywordPlus | Snark | - |
dc.subject.keywordPlus | Track sets | - |
dc.subject.keywordPlus | Zero knowledge | - |
dc.subject.keywordAuthor | accumulators | - |
dc.subject.keywordAuthor | snarks | - |
dc.subject.keywordAuthor | zero-knowledge | - |
dc.identifier.url | https://dl.acm.org/doi/10.1145/3548606.3560677 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.