Stability of remote voting protocols to compromise of network subscribers: an information-theoretical approach

O. A. Kozlitin

Certification Research Center, LLC, Moscow

Abstract: The paper discusses the possibility of building remote voting protocols that are resistant to compromise of a given number of subscribers based on secret sharing schemes. The concept of stability of remote voting protocols is formalized in terms of information theory. The article is a continuation of the series of papers [1] and [2].

Key words: remote voting protocol, permutation polynomial, conditional entropy.

UDC: 519.719.2+519.722

Received 21.V.2025

DOI: 10.4213/mvk501