[en] 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.
Disciplines :
Computer science
Author, co-author :
VITTO, Giuseppe ; University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > Cryptolux
BIRYUKOV, Alexei ; University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
External co-authors :
no
Language :
English
Title :
Dynamic Universal Accumulator with Batch Update over Bilinear Groups
Publication date :
2022
Event name :
CT-RSA 2022
Event date :
March 1-2, 2022
Audience :
International
Main work title :
Topics in Cryptology - CT-RSA 2022 - Cryptographers' Track at the RSA Conference 2022
Publisher :
Springer
ISBN/EAN :
978-3-030-95311-9
Peer reviewed :
Peer reviewed
Focus Area :
Computational Sciences
FnR Project :
FNR11684537 - Security, Scalability, And Privacy In Blockchain Applications And Smart Contracts, 2017 (01/08/2018-31/07/2021) - Alex Biryukov
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.
