Fakultät für Informatik und Mathematik


Paper Description

BibTeX entry

author={H. de Meer, M. Liedel, H. Pöhls, J. Posegga, K. Samelin},
title={{Indistinguishability of One-Way Accumulators}},
institution={{Fakult{\"a}t f{\"u}r Informatik und Mathematik, Universit{\"a}t Passau}},


One-Way Accumulators have been introduced by Benaloh and de Mare at Eurocrypt ’93. They allow to hash a potentially very large set into a short digest, called the accumulator. The accumulator allows to verify the membership of a given element using corresponding witnesses. State-of-the-Art research focuses on the collision-resistance of the resulting schemes. However, there are many applications, where the accumulator must be hiding, i.e., if a third party does not have all members, it should not be able to decide how many additional members a given accumulator has. This behavior of indistinguishability is already used in many cryptographic applications, but has neither been formalized nor formally proven. In this paper, we close this gap by proving that the construction by Bari ́ and Pfitzmann, presented at Eurocrypt ’97, fulfills our new notion. In particular, their accumulator is perfectly indistinguishable. Moreover, we show that the accumulator presented at FSE ’96 by Nyberg does not fulfill this requirement.

Paper itself