Abstract
The decentralized voting protocol based on the Lagrange interpolant construction is analyzed for the potential error detection in the set of shares. We suggest an algorithm for the error locator polynomial construction based on procedure of computation the determinants of the Hankel type generated by the sequence of special symmetric functions of the set of shares.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382–401 (1982)
Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)
Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 509–539. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53018-4_19
Pólya, G., Szegö, G.: Problems and Theorems in Analysis II. Springer, Heidelberg (1998). https://doi.org/10.1007/978-3-642-61905-2
Uteshev, A.Yu., Baravy, I.: Solution of interpolation problems via the Hankel polynomial construction. arXiv:1603.08752 [cs.SC] (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Bogdanov, A., Uteshev, A., Khvatov, V. (2019). Error Detection in the Decentralized Voting Protocol. In: Misra, S., et al. Computational Science and Its Applications – ICCSA 2019. ICCSA 2019. Lecture Notes in Computer Science(), vol 11620. Springer, Cham. https://doi.org/10.1007/978-3-030-24296-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-24296-1_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24295-4
Online ISBN: 978-3-030-24296-1
eBook Packages: Computer ScienceComputer Science (R0)