We show two realizations of VCs based on standard and well established assumptions, such as RSA, and Computational Diffie-Hellman (in bilinear groups). Next, we turn our attention to applications and we show that Vector Commitments are useful in a variety of contexts, as they allow for compact and efficient solutions which significantly improve previous works either in terms of efficiency of the resulting solutions, or in terms of "quality" of the underlying assumption, or both. These applications include: Verifiable Databases with Efficient Updates, Updatable Zero-Knowledge Databases, and Universal Dynamic Accumulators.
Category / Keywords: Vector Commitments, Commitments, Accumulator, Zero-Knowledge Databases, Verifiable Databases Publication Info: Full version of the paper that is going to appear in the proceedings of PKC 2013 Date: received 12 Sep 2011, last revised 10 Dec 2012 Contact author: fiore at cs nyu edu Available format(s): PDF | BibTeX Citation Version: 20121210:142815 (All versions of this report) Short URL: ia.cr/2011/495