Conference Proceedings

Zero-knowledge accumulators and set algebra

E Ghosh, O Ohrimenko, D Papadopoulos, R Tamassia, N Triandopoulos

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Published : 2016


Cryptographic accumulators allowto succinctly represent a set by an accumulation value with respect to which short (non-)membership proofs about the set can be efficiently constructed and verified. Traditionally, their security captures soundness but offers no privacy: Convincing proofs reliably encode set membership, but they may well leak information about the accumulated set. In this paper we put forward a strong privacy-preserving enhancement by introducing and devising zero-knowledge accumulators that additionally provide hiding guarantees: Accumulation values and proofs leak nothing about a dynamic set that evolves via element insertions/ deletions. We formalize the new property using ..

View full abstract


Citation metrics