![](bg9.png)
ACKNOWLEDGMENTS
This material is based upon work supported by, or
in part by,the National Science Foundation (NSF)
under grants CCF-1562659, CCF-1562306, CCF-
1617690, CCF-1822191, CCF-1821431, and The Sci-
entific and Technological Research Council of Turkey
(TUBITAK). The views and conclusions contained
herein are those of the authors and should not be in-
terpreted as representing the official policies, views,
or endorsements, either expressed or implied, of the
NSF or TUBITAK.
REFERENCES
Akkaya, K. and Cebe, M. (2018). Efficient public-key revo-
cation management for secure smart meter communi-
cations using one-way cryptographic accumulators. In
IEEE International Conference on Communications.
Florida International University.
Au, M. H., Tsang, P. P., Susilo, W., and Mu, Y. (2009). Dy-
namic universal accumulators for ddh groups and their
application to attribute-based anonymous credential
systems. In Cryptographers’ track at the RSA con-
ference, pages 295–308. Springer.
Baldimtsi, F., Camenisch, J., Dubovitskaya, M., Lysyan-
skaya, A., Reyzin, L., Samelin, K., and Yak-
oubov, S. (2017). Accumulators with applications
to anonymity-preserving revocation. In 2017 IEEE
European Symp. on Security & Privacy (EuroS&P),
pages 301–315. IEEE.
Bari
´
c, N. and Pfitzmann, B. (1997). Collision-free accumu-
lators and fail-stop signature schemes without trees.
In International Conference on the Theory and Appli-
cations of Cryptographic Techniques, pages 480–494.
Springer.
Benaloh, J. and De Mare, M. (1993). One-way accumula-
tors: A decentralized alternative to digital signatures.
In Workshop on the Theory and Application of of
Cryptographic Techniques, pages 274–285. Springer.
Bitcoin.org (2020a). Application of Bloom filters.
https://bitcoin.org/en/operating-modes-guide#
application-of-bloom-filters. [ Online; Ac-
cessed:March/2020 ].
Bitcoin.org (2020b). Merkleblock. https://bitcoin.org/
en/developer-reference#merkleblock. [ Online; Ac-
cessed:March/2020 ].
Bloom, B. H. (1970). Space/time trade-offs in hash coding
with allowable errors. Comm. of the ACM, 13(7):422–
426.
Camenisch, J. and Lysyanskaya, A. (2002). Dynamic
accumulators and application to efficient revocation
of anonymous credentials. In Annual International
Cryptology Conference, pages 61–76. Springer.
Derler, D., Hanser, C., and Slamanig, D. (2015). Revisit-
ing cryptographic accumulators, additional properties
and relations to other primitives. In Cryptographers’
track—RSA conf., pages 127–144. Springer.
Fan, B., Andersen, D. G., Kaminsky, M., and Mitzen-
macher, M. D. (2014). Cuckoo filter: Practically better
than bloom. In Proceedings of the 10th ACM Interna-
tional on Conference on emerging Networking Exper-
iments and Technologies, pages 75–88.
Fazio, N. and Nicolosi, A. (2002). Cryptographic ac-
cumulators: Definitions, constructions and applica-
tions. Paper written for course at New York Univer-
sity: www. cs. nyu. edu/nicolosi/papers/accumulators.
pdf.
Ghosh, E., Ohrimenko, O., Papadopoulos, D., Tamassia, R.,
and Triandopoulos, N. (2016). Zero-knowledge accu-
mulators and set algebra. In International Conference
on the Theory and Application of Cryptology and In-
formation Security, pages 67–100. Springer.
Ghosh, E., Ohrimenko, O., and Tamassia, R. (2014). Ver-
ifiable member and order queries on a list in zero-
knowledge. arXiv preprint arXiv:1408.3843.
Goldwasser, S., Micali, S., and Rackoff, C. (1989). The
knowledge complexity of interactive proof systems.
SIAM Journal on computing, 18(1):186–208.
Goodrich, M. T., Tamassia, R., and Hasi
´
c, J. (2002). An
efficient dynamic and distributed cryptographic accu-
mulator. In Int. Conf. on Info. Security, pages 372–
388. Springer.
Kumar, A., Lafourcade, P., and Lauradoux, C. (2014). Per-
formances of cryptographic accumulators. In 39th An-
nual IEEE Conference on Local Computer Networks,
pages 366–369. IEEE.
Li, J., Li, N., and Xue, R. (2007). Universal accumula-
tors with efficient nonmembership proofs. In Interna-
tional Conference on Applied Cryptography and Net-
work Security, pages 253–269. Springer.
Merkle, R. C. (1989). A certified digital signature. In Conf.
on the Theory and Application of Cryptology, pages
218–238. Springer.
Miers, I., Garman, C., Green, M., and Rubin, A. D. (2013).
Zerocoin: Anonymous distributed e-cash from bit-
coin. In 2013 IEEE Symposium on Security and Pri-
vacy, pages 397–411. IEEE.
Morais, E., van Wijk, C., and Koens, T. (2018). Zero knowl-
edge set membership.
Reyzin, L. and Yakoubov, S. (2016). Efficient asynchronous
accumulators for distributed pki. In International
Conference on Security and Cryptography for Net-
works, pages 292–309. Springer.
Slamanig, D. (2012). Dynamic accumulator based discre-
tionary access control for outsourced storage with un-
linkable access. In Int. Conf. on Financial Crypto. &
Data Security, pages 215–222. Springer.
Sudarsono, A., Nakanishi, T., and Funabiki, N. (2011). Effi-
cient proofs of attributes in pairing-based anonymous
credential system. In International Symposium on Pri-
vacy Enhancing Technologies Symposium, pages 246–
263. Springer.
Tremel, E. (2013). Real-world performance of crypto-
graphic accumulators. Thesis, Brown U.
Weisstein, E. W. One-way function. from Mathworld - a
Wolfram web resource. https://mathworld.wolfram.
com/One-WayFunction.html. [ Online; Accessed:
March/2020 ].
Weisstein, E. W. One-way hash function. from math-
world - a wolfram web resource. https://mathworld.
wolfram.com/One-WayHashFunction.html. [ Online;
Accessed: March/2020 ].
An Overview of Cryptographic Accumulators
669