conference paper
Zero-Knowledge Accumulators and Set Algebra
Esha Ghosha✉, Olga Ohrimenkob, Dimitrios Papadopoulosc, Roberto Tamassiaa, Nikos Triandopoulosd
- aDepartment of Computer Science, Brown University, Providence, USA
- bMicrosoft Research, Cambridge, UK
- cUniversity of Maryland, College Park, USA
- dStevens Institute of Technology, Hoboken, USA
- ✉Corresponding author
Lecture notes in computer scienceSpringer Science+Business Media2016-01-01 42 citations63 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThe first dynamic universal zero-knowledge accumulator is constructed that is shown to be perfect zero- knowledge and secure under the q-Strong Bilinear Diffie-Hellman assumption and extended to provide privacy-preserving proofs also for an authenticated dynamic set collection. (Semantic Scholar)