ZAC: Efficient Zero-Knowledge Dynamic Universal Accumulator and Application to Zero-Knowledge Elementary Database
dc.contributor.author | Dang, Hai-Van | |
dc.contributor.author | Phuong, TVX | |
dc.contributor.author | Nguyen, TD | |
dc.contributor.author | Hoang, T | |
dc.date.accessioned | 2023-03-27T09:46:02Z | |
dc.date.available | 2023-03-27T09:46:02Z | |
dc.date.issued | 2022-12 | |
dc.identifier.isbn | 9781665474085 | |
dc.identifier.uri | https://pearl.plymouth.ac.uk/handle/10026.1/20633 | |
dc.description.abstract |
—Zero-knowledge universal accumulator generates the succinct commitment to a set and produces the short (non) membership proof (universal) without leaking information about the set (zero-knowledge). In order to further support a generic set and zero-knowledge, existing techniques generally combine the zero-knowledge universal accumulator with other protocols, such as digital signatures and hashes to primes, which incur high overhead and may not be suitable for real-world use. It is desirable to commit a set of membership concealing the information with the optimal complexity. We devise ZAC, a new zero-knowledge Dynamic Universal Accumulator by taking the existing cryptographic primitives into account to produce a new efficient accumulator. Our underlying building blocks are Bloom Filter and vector commitment scheme in [19], utilizing the binary expression and aggregation to achieve efficiency, generic set support, zero-knowledge and universal properties. As a result, our scheme is improved in terms of proof size and proof time, also comparable to the RSA-based set accumulator in [8] in the verifying complexity. With 128 bit security, our proof size is 48 bytes while theirs is 1310 bytes and the running time of elliptic curve-based methods is faster than RSA-based counterpart. ZAC is proved to be complete, ϵ-sound and zero-knowledge. Extensively, based on ZAC as building block, we construct a new Zero-Knowledge Elementary Database (ZKEDB), which consumes 5 times less storage space, O(log N) less bandwidth, and O(log N) more efficient in proving and verification than the state-of-art work in [13] (where N is the domain space size). ZKEDB is proved to be complete, ϵ-sound and zero-knowledge. ZKEDB supports a new type of select top ℓ query, and can be extended to non-elementary databases. | |
dc.format.extent | 248-257 | |
dc.publisher | IEEE | |
dc.subject | zero-knowledge universal dynamic accumulator | |
dc.subject | zero-knowledge set (database) | |
dc.subject | Bloom filter | |
dc.title | ZAC: Efficient Zero-Knowledge Dynamic Universal Accumulator and Application to Zero-Knowledge Elementary Database | |
dc.type | conference | |
dc.type | Conference Proceeding | |
plymouth.author-url | https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000978301700028&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=11bb513d99f797142bcfeffcc58ea008 | |
plymouth.date-start | 2022-12-14 | |
plymouth.date-finish | 2022-12-17 | |
plymouth.volume | 00 | |
plymouth.conference-name | 2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA) | |
plymouth.publication-status | Published | |
plymouth.journal | 2022 IEEE 4th International Conference on Trust, Privacy and Security in Intelligent Systems, and Applications (TPS-ISA) | |
dc.identifier.doi | 10.1109/tps-isa56441.2022.00038 | |
plymouth.organisational-group | |Plymouth | |
plymouth.organisational-group | |Plymouth|Faculty of Science and Engineering | |
plymouth.organisational-group | |Plymouth|Faculty of Science and Engineering|School of Engineering, Computing and Mathematics | |
plymouth.organisational-group | |Plymouth|REF 2021 Researchers by UoA | |
plymouth.organisational-group | |Plymouth|Users by role | |
plymouth.organisational-group | |Plymouth|Users by role|Academics | |
plymouth.organisational-group | |Plymouth|REF 2021 Researchers by UoA|UoA11 Computer Science and Informatics | |
dcterms.dateAccepted | 2022-10-26 | |
dc.date.updated | 2023-03-27T09:45:46Z | |
dc.rights.embargodate | 2023-3-28 | |
dc.rights.embargoperiod | forever | |
rioxxterms.versionofrecord | 10.1109/tps-isa56441.2022.00038 |