Extending the functionality of blind accumulators: contexts

  • Sergey V. Agievich Research Institute for Applied Problems of Mathematics and Informatics, Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus
  • Maksim A. Kazlouski Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

Abstract

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.

Author Biographies

Sergey V. Agievich, Research Institute for Applied Problems of Mathematics and Informatics, Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

PhD (physics and mathematics); head of the IT security research laboratory

 

Maksim A. Kazlouski, Belarusian State University, 4 Niezaliezhnasci Avenue, Minsk 220030, Belarus

postgraduate student at the department of mathematical modelling and data analysis, faculty of applied mathematics and computer science

 

References

  1. Agievich S. Blind accumulators for e-voting. In: Nemoga K, Ploszek R, Zajac P, editors. Proceedings of Central European conference on cryptology – CECCʼ22; 2022 June 26–29; Smolenice, Slovakia. Bratislava: Mathematical Institute of the Slovak Academy of Sciences; 2022. p. 15–18.
  2. Bellare M, Rogaway P. Random oracles are practical: a paradigm for designing efficient protocols. In: Denning DE, Pyle R, Ganesan R, Sandhu RS, Ashby V, editors. CCSʼ93. Proceedings of the 1st ACM conference on computer and communications security; 1993 November 3–5; Fairfax, USA. New York: Association for Computing Machinery; 1993. p. 62–73. DOI: 10.1145/168588.168596.
  3. Boneh D. The decision Diffie – Hellman problem. In: Buhler JP, editor. Algorithmic number theory. Proceedings of the Third International symposium, ANTS-III; 1998 June 21–25; Portland, USA. Berlin: Springer; 1998. p. 48–63 (Goos G, Hartmanis J, van Leeuwen J, editors. Lecture notes in computer science; volume 1423). DOI: 10.1007/BFb0054851.
  4. Cramer RJF. Modular design of secure yet practical cryptographic protocols [dissertation on the Internet]. Amsterdam: Universiteit van Amsterdam; 1997 [cited 2023 December 1]. 187 p. Available from: https://ir.cwi.nl/pub/21438/21438A.pdf.
  5. Damgård I. On Σ-protocols [Internet]. Aarhus: University of Aarhus; 2002 [cited 2023 December 1]. 22 p. Available from: https://cs.au.dk/~ivan/Sigma.pdf.
Published
2024-04-16
Keywords: e-voting, revoting, cryptographic accumulator, blind accumulator, decisional Diffie – Hellman problem
Supporting Agencies The authors thank the anonymous referees for their valuable feedback that helped improve the editorial and technical quality of the paper.
How to Cite
Agievich, S. V., & Kazlouski, M. A. (2024). Extending the functionality of blind accumulators: contexts. Journal of the Belarusian State University. Mathematics and Informatics, 1, 79-85. Retrieved from https://journals.bsu.by/index.php/mathematics/article/view/6016
Issue
No 1 (2024): Journal of the Belarusian State University. Mathematics and Informatics
Section
Short Communications

Copyright (c) 2024 Journal of the Belarusian State University. Mathematics and Informatics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

The authors who are published in this journal agree to the following:

  1. The authors retain copyright on the work and provide the journal with the right of first publication of the work on condition of license Creative Commons Attribution-NonCommercial. 4.0 International (CC BY-NC 4.0).
  2. The authors retain the right to enter into certain contractual agreements relating to the non-exclusive distribution of the published version of the work (e.g. post it on the institutional repository, publication in the book), with the reference to its original publication in this journal.
  3. The authors have the right to post their work on the Internet (e.g. on the institutional store or personal website) prior to and during the review process, conducted by the journal, as this may lead to a productive discussion and a large number of references to this work. (See The Effect of Open Access.)