Strong RSA (safe-prime moduli) ⇒ dynamic accumulator
Statement
If the strong RSA assumption for safe-prime moduli holds, for moduli with safe primes and , the RSA accumulator with for , domain the primes in other than and , where and , with chosen so that contains superpolynomially many primes (e.g. , , ), value , and a witness for checked by , is a collision-free accumulator, and it is a dynamic accumulator: an element is added by and deleted by the manager, who knows the factorization of , as , and every holder of a witness for an element still in the set updates it after each change from public information, without the factorization — CL02.
Notes
- With a zero-knowledge proof that a committed value is accumulated, the dynamic accumulator revokes anonymous credentials, with proving and verifying non-revocation at a cost independent of the number of credentials issued or revoked, while each holder updates its witness after every change — CL02.
- The static RSA accumulator is Strong RSA ⇒ accumulator — BP97.