The robust distributed ledger model for a multidimensional blockchain security analysis

Shilov I.M., Zakoldaev D.A. The robust distributed ledger model for a multidimensional blockchain security analysis. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2021, vol. 21, no. 2, pp. 249–255 (in Russian). doi: 10.17586/2226-1494-2021-21-2-249-255

The paper considers the problem of constructing a model of the robust distributed ledger for security proof of a multidimensional blockchain. Several requirements for the model are imposed, among which most important are compatibility with existing models and presence of functionalities for external transactions. The authors present an approach to extending existing models based on the analysis of these solutions, their advantages and disadvantages. The model construction is based on universal composability framework. Two models are proposed: a model of the robust distributed ledger and a model of the search and verification protocol. These are meant to be used in security proofs for scaling and registration in a multidimensional blockchain. The proposed model of the robust distributed ledger is an extension of models used in security proofs for consensus mechanisms: proof of work and proof of stake. It duplicates their functions and additionally maintains external transactions. The model of the search and verification protocol implements ideal functionality used for external transaction verification. The results prove that the proposed model does not damage essential security parameters of the robust distributed ledger in presence of external transactions. The study confirms the compatibility of the proposed models with existing analogues implementing robust distributed ledgers. This fact allows using the universal composability theorem for constructing security proofs of multidimensional blockchain and search and verification protocol. The proposed method of extending existing models for security proofs can be used to create new models with additional functions not implemented for security proof of a multidimensional blockchain.

1. Garay J., Kiayias A., Leonardos N. The bitcoin backbone protocol: Analysis and applications. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015, vol. 9057, pp. 281–310. doi: 10.1007/978-3-662-46803-6_10
2. Garay J., Kiayias A., Leonardos N. The bitcoin backbone protocol: Analysis and applications. Available at: https://eprint.iacr.org/2014/765.pdf (accessed: 15.03.21).
3. Garay J., Kiayias A., Leonardos N. The bitcoin backbone protocol with chains of variable difficulty. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, vol. 10401, pp. 291–323. doi: 10.1007/978-3-319-63688-7_10
4. Badertscher C., Gaži P., Kiayias A., Russell A., Zikas V. Ouroboros genesis: Composable proof-of-stake blockchains with dynamic availability.Proc. 25^th ACM Conference on Computer and Communications Security (CCS 2018), 2018, pp. 913–930. doi: 10.1145/3243734.3243848
5. Kiayias A., Russell A., David B., Oliynykov R. Ouroboros: A provably secure proof-of-stake blockchain protocol. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, vol. 10401, pp. 357–388. doi: 10.1007/978-3-319-63688-7_12
6. David B., Gaži P., Kiayias A., Russell A. Ouroboros praos: An adaptively-secure, semi-synchronous proof-of-stake blockchain. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, vol. 10821, pp. 66–98. doi: 10.1007/978-3-319-78375-8_3
7. Cachin C., Vukolić M. Blockchain consensus protocols in the wild. Leibniz International Proceedings in Informatics, LIPIcs, 2017, vol. 91, pp. 1.1–1.16. doi: 10.4230/LIPIcs.DISC.2017.1
8. Canetti R. Universally composable security: a new paradigm for cryptographic protocols. Proc. 42^nd IEEE Symposium on Foundations of Computer Science. Newport Beach, CA, USA, 2001, pp. 136–145. doi: 10.1109/sfcs.2001.959888
9. Canetti R., Dodis Y., Pass R., Walfish S. Universally composable security with global setup. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2007, vol. 4392, pp. 61–85. doi: 10.1007/978-3-540-70936-7_4
10. Shilov I.M., Zakoldaev D.A. Multidimensional blockchain and its advantages. Information Technology, 2020, vol. 26, no. 6, pp. 360–367. (in Russian). doi: 10.17587/it.26.360-367
11. Badertscher C., Maurer U., Tschudi D., Zikas V. Bitcoin as a transaction ledger: A composable treatment. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, vol. 10401, pp. 324–356. doi: 10.1007/978-3-319-63688-7_11
12. Kosba A., Miller A., Shi E., Wen Z., Papamanthou C. Hawk: The blockchain model of cryptography and privacy-preserving smart contracts. Proc. 2016 IEEE Symposium on Security and Privacy, 2016, pp. 839–858. doi: 10.1109/SP.2016.55
13. Pass R., Seeman L., Shelat A. Analysis of the blockchain protocol in asynchronous networks. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017, vol. 10211, pp. 643–673. doi: 10.1007/978-3-319-56614-6_22
14. Hirt M., Zikas V. Adaptively secure broadcast. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, vol. 6110, pp. 466–485. doi: 10.1007/978-3-642-13190-5_24
15. Canetti R., Jain A., Scafuro A. Practical UC security with a global random oracle. Proc. 21^st ACM Conference on Computer and Communications Security, CCS, 2014, pp. 597–608. doi: 10.1145/2660267.2660374

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