File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-319-93638-3_29
- Scopus: eid_2-s2.0-85049778937
- WOS: WOS:000546267700029
- Find via
Supplementary
- Citations:
- Appears in Collections:
Conference Paper: Lattice-based universal accumulator with nonmembership arguments
Title | Lattice-based universal accumulator with nonmembership arguments |
---|---|
Authors | |
Keywords | Abstract stern-like protocol Zero-knowledge arguments of nonmembership Lattice-based universal accumulator |
Issue Date | 2018 |
Citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, v. 10946 LNCS, p. 502-519 How to Cite? |
Abstract | © Springer International Publishing AG, part of Springer Nature 2018. Universal accumulator provides a way to accumulate a set of elements into one. For each element accumulated, it can provide a short membership (resp. nonmembership) witness to attest the fact that the element has been (resp. has not been) accumulated. When combined with a suitable zero-knowledge proof system, it can be used to construct many privacy-preserving applications. However, existing universal accumulators are usually based on non-standard assumptions, e.g., the Strong RSA assumption and the Strong Diffie-Hellman assumptions, and are not secure against quantum attacks. In this paper, we propose the first lattice-based universal accumulator from standard lattice-based assumptions. The starting point of our work is the lattice-based accumulator with Merkle-tree structure proposed by Libert et al. (Eurocrypt’16). We present a novel method to generate short witnesses for non-accumulated members in a Merkle-tree, and give the construction of universal accumulator. Besides, we also propose the first zero-knowledge arguments to prove the possession of the nonmembership witness of a non-accumulated value in the lattice-based setting via the abstract Stern’s protocol of Libert et al. (Asiacrypt’17). Moreover, our proposed universal accumulator can be used to construct many privacy-preserving cryptographic primitives, such as group signature and anonymous credential. |
Persistent Identifier | http://hdl.handle.net/10722/280761 |
ISSN | 2023 SCImago Journal Rankings: 0.606 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yu, Zuoxia | - |
dc.contributor.author | Au, Man Ho | - |
dc.contributor.author | Yang, Rupeng | - |
dc.contributor.author | Lai, Junzuo | - |
dc.contributor.author | Xu, Qiuliang | - |
dc.date.accessioned | 2020-02-17T14:34:52Z | - |
dc.date.available | 2020-02-17T14:34:52Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, v. 10946 LNCS, p. 502-519 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10722/280761 | - |
dc.description.abstract | © Springer International Publishing AG, part of Springer Nature 2018. Universal accumulator provides a way to accumulate a set of elements into one. For each element accumulated, it can provide a short membership (resp. nonmembership) witness to attest the fact that the element has been (resp. has not been) accumulated. When combined with a suitable zero-knowledge proof system, it can be used to construct many privacy-preserving applications. However, existing universal accumulators are usually based on non-standard assumptions, e.g., the Strong RSA assumption and the Strong Diffie-Hellman assumptions, and are not secure against quantum attacks. In this paper, we propose the first lattice-based universal accumulator from standard lattice-based assumptions. The starting point of our work is the lattice-based accumulator with Merkle-tree structure proposed by Libert et al. (Eurocrypt’16). We present a novel method to generate short witnesses for non-accumulated members in a Merkle-tree, and give the construction of universal accumulator. Besides, we also propose the first zero-knowledge arguments to prove the possession of the nonmembership witness of a non-accumulated value in the lattice-based setting via the abstract Stern’s protocol of Libert et al. (Asiacrypt’17). Moreover, our proposed universal accumulator can be used to construct many privacy-preserving cryptographic primitives, such as group signature and anonymous credential. | - |
dc.language | eng | - |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
dc.subject | Abstract stern-like protocol | - |
dc.subject | Zero-knowledge arguments of nonmembership | - |
dc.subject | Lattice-based universal accumulator | - |
dc.title | Lattice-based universal accumulator with nonmembership arguments | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/978-3-319-93638-3_29 | - |
dc.identifier.scopus | eid_2-s2.0-85049778937 | - |
dc.identifier.volume | 10946 LNCS | - |
dc.identifier.spage | 502 | - |
dc.identifier.epage | 519 | - |
dc.identifier.eissn | 1611-3349 | - |
dc.identifier.isi | WOS:000546267700029 | - |
dc.identifier.issnl | 0302-9743 | - |