What is the Bilinear-map accumulator disadvantage Bilinear-map accumulator [1] is more efficient than the RSA accumulator [2] but do you know any disadvantage for the bilinear-map accumulator when compared to RSA accumulator?
I will list two disadvantages that come to mind.


A bilinear accumulator requires a public parameter which is linear in size, which means you need to have an upper bound on the number of data elements you would commit to the accumulator. The RSA accumulator requires a public parameter which is constant-sized.
A bilinear accumulator does not allow dynamic updates. If you have an accumulated digest $$A = g_1^{\prod\limits_{i=1}^N (s+d_i)}\;\;\; (s = \text{ the trapdoor}) $$ and need to insert a new element $d$, you would need to update the accumulated digest to $A^{s+d} = A^s*A^d$. But in order to compute $A^s$ without the trapdoor, you would need to know the coefficients of the polynomial $f(X):=\prod\limits_{i=1}^N (X+d_i)$. You would then compute the coefficients of $Xf(X)$ and use those to compute $A^s$. Thus, inserting a single element has a run time of $O(N)$.