We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized
under the probabilistic, iterative, and deterministic schemes. The schemes are based upon …

The post-quantum security of electronic voting protocols such as lattice-based ones are
based on the assumption of certain difficult computational problems, which cannot be solved …

We propose a set of protocols for quantum anonymous veto (QAV) broadly categorized
under the probabilistic, iterative, and deterministic schemes. The schemes are based upon …

Executive summary Introduction. In today's digital world, many elections are conducted
online. In such elections, however, there is a risk that voters' votes may be altered unnoticed …

Автор дополняет существующие подходы к исследованию политического участия в
контексте концепции «умный город». Освещаются проблемы и особенности участия …

We provide a self-tallying voting protocol based on the hardness of decision version of the
ring learning with errors problem. We present two versions of the protocol, the first one is …