Lower Bounds on Transparent Vector Commitments
We prove a lower bound on the size of commitments and openings of algebraic vector commitment schemes with transparent public parameters in Maurer’s Generic Group Model with pairings, and give a pairing-based scheme that beats the lower bound for schemes without pairings.