Асиметричні криптографічні протоколи з блокчейн-ядром: проблеми побудови та їх рішення: Fìz.-mat. model. ìnf. tehnol. 2021, 32:175-180

The problem of axiomatic construction of secure cryptographic protocols is closely related to the choice of basic cryptographic blocks from which a cryptographic protocol of arbitrary complexity can be built. Let’s call such blocks primitive cryptographic protocols. Along with a traditional choice a...

Full description

Saved in:
Bibliographic Details
Date:2021
Main Authors: Kudin, Anton, Seliukh, Polina
Format: Article
Language:Ukrainian
Published: Інститут прикладних проблем механіки і математики ім. Я. С. Підстригача НАН України 2021
Subjects:
Online Access:https://www.fmmit.lviv.ua/index.php/fmmit/article/view/182
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Physico-mathematical modeling and informational technologies

Institution

Physico-mathematical modeling and informational technologies
Description
Summary:The problem of axiomatic construction of secure cryptographic protocols is closely related to the choice of basic cryptographic blocks from which a cryptographic protocol of arbitrary complexity can be built. Let’s call such blocks primitive cryptographic protocols. Along with a traditional choice as primitive secret sharing protocols and non-interactive proof protocols today blockchain is considered to be a primitive cryptographic protocol. The security of such cryptographic protocols with a blockchain core is studied a bit today. We consider the methods for increasing the security of protocols with blockchain core by using a new agreement protocol in the blockchain, which is secure in the information theoretically sense. References Goldreich, O. (2001). Foundations of Cryptography. Volume 1. Basic Tools. – London: Cambridge University Press. Miller, V. S. (2004). The Weil pairing, and its efficient calculation. J. Cryptology, 17(4), 235–261. Rabin, Michael O. (1983). Transaction Protection by Beacons. Journal of Computer and System Sciences, 27(2), 256-267. Mihir, B., Phillip, R. (1993). Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. ACM Conference on Computer and Communications Security journal, 62—73. Blum, M., de Santis, A., Micali, S., Persiano,G. (1991). Non-interactive zero knowledge. SIAM J. COMPUT., 20(6), 1084-1118. Goyal, R., Goyal, V. (2017). Overcoming Cryptographic Impossibility Results Using Blockchains. In: Kalai Y., Reyzin L. (eds) Theory of Cryptography. TCC 2017. Lecture Notes in Computer Science. Springer, Cham., 10677. https://doi.org/10.1007/978-3-319-70500-2_18 Forte, P., Romano, D., Schmid, G. (2016). Beyond Bitcoin – Part II: Blockchain-based systems without mining. Cryptology ePrint Archive: Report 2016/747. https://eprint.iacr.org/2016/747 Kudin, A. M., Kovalchuk, L. V., Kovalenko, B. A. (2019). Teoretychni zasady ta zastosuvannia blokchein-tekhnolohii: implementatsiia novykh protokoliv konsensusu ta kraudsorsinh obchyslen. Matematychne ta kompiuterne modeliuvannia. Seriia: Tekhnichni nauky, 19, 56-62. Steiner, M., Tsudik, G., Waidner, M. Diffie-Hellman key distribution extended to groups. Proceeding CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security, 31 - 37.
DOI:10.15407/fmmit2021.32.175