Geodesic
Extending the functionality of blind accumulators: contexts
Journal of the Belarusian State University. Mathematics and Informatics, Tome 1 (2024), pp. 79-85.

Voir la notice de l'article provenant de la source Math-Net.Ru

Blind accumulators collect private keys of eligible entities in a decentralised manner not getting information about the keys. Once the accumulation is complete, an entity processes the resulting accumulator and derives a public key which refers to a private key previously added by this entity. We extend the blind accumulator scheme with the context functionality so that the derived key is bound to a specific context and this key is computationally hard to associate with public keys of other contexts. Blind accumulators with contexts are useful in various e-voting scenarios, for example in revoting. We provide an instantiation of the extended blind accumulator scheme and justify its security.
Keywords: E-voting; revoting; cryptographic accumulator; blind accumulator; decisional Diffie – Hellman problem 
@article{BGUMI_2024_1_a6,
     author = {S. V. Agievich and M. A. Kazlouski},
     title = {Extending the functionality of blind accumulators: contexts},
     journal = {Journal of the Belarusian State University. Mathematics and Informatics},
     pages = {79--85},
     publisher = {mathdoc},
     volume = {1},
     year = {2024},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/BGUMI_2024_1_a6/}
}
TY  - JOUR
AU  - S. V. Agievich
AU  - M. A. Kazlouski
TI  - Extending the functionality of blind accumulators: contexts
JO  - Journal of the Belarusian State University. Mathematics and Informatics
PY  - 2024
SP  - 79
EP  - 85
VL  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/BGUMI_2024_1_a6/
LA  - ru
ID  - BGUMI_2024_1_a6
ER  - 
%0 Journal Article
%A S. V. Agievich
%A M. A. Kazlouski
%T Extending the functionality of blind accumulators: contexts
%J Journal of the Belarusian State University. Mathematics and Informatics
%D 2024
%P 79-85
%V 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/BGUMI_2024_1_a6/
%G ru
%F BGUMI_2024_1_a6
S. V. Agievich; M. A. Kazlouski. Extending the functionality of blind accumulators: contexts. Journal of the Belarusian State University. Mathematics and Informatics, Tome 1 (2024), pp. 79-85. http://geodesic.mathdoc.fr/item/BGUMI_2024_1_a6/

[1] S. Agievich, “Blind accumulators for e-voting”, Proceedings of Central European conference on cryptology – CECC;22 (Smolenice, Slovakia), Mathematical Institute of the Slovak Academy of Sciences, Bratislava, 2022, 15–18

[2] M. Bellare, P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols”, Proceedings of the 1st ACM conference on computer and communications security (Fairfax, USA), Association for Computing Machinery, New York, 1993, 62–73 | DOI

[3] D. Boneh, “The decision Diffie – Hellman problem”, Algorithmic number theory. Proceedings of the Third International symposium, ANTS-III (Portland, USA), Springer, Berlin, 1998, 48–63 (Lecture notes in computer science; volume 1423) | DOI

[4] RJF. Cramer, Modular design of secure yet practical cryptographic protocols [dissertation on the Internet], Universiteit van Amsterdam, Amsterdam, 1997, +187 pp.

[5] I. Damgard, On Sum-protocols [Internet], University of Aarhus, Aarhus, 2002, 22 pp.