Reference : Dynamic Universal Accumulator with Batch Update over Bilinear Groups
E-prints/Working papers : Already available on another site
Engineering, computing & technology : Computer science
Computational Sciences
http://hdl.handle.net/10993/49497
Dynamic Universal Accumulator with Batch Update over Bilinear Groups
English
Vitto, Giuseppe mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Cryptolux >]
Biryukov, Alexei mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
2021
No
[en] accumulator ; universal ; dynamic ; batch update ; privacy-preserving KYC ; anonymous credentials
Fonds National de la Recherche - FnR
http://hdl.handle.net/10993/49497
We propose a Dynamic Universal Accumulator in the Accumulator Manager setting for bilinear groups which extends Nguyen's positive accumulator and Au et al. and Damgård and Triandopoulos non-membership proof mechanism. The new features include support for batch addition and deletion operations as well as a privacy-friendly batch witness update protocol, where the witness update information is the same for all users. Together with a non-interactive zero-knowledge protocol, these make the proposed scheme suitable as an efficient and scalable Anonymous Credential System, accessible even by low-resource users.
We show security of the proposed protocol in the Generic Group Model under a (new) generalized version of the t-SDH assumption and we demonstrate its practical relevance by providing and discussing an implementation realized using state-of-the-art libraries.
https://eprint.iacr.org/2020/777
FnR ; FNR11684537 > Alex Biryukov > FinCrypt > Security, Scalability, And Privacy In Blockchain Applications And Smart Contracts > 01/08/2018 > 31/07/2021 > 2017

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
accumulator.pdfAuthor preprint496.89 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.