Affiliation:
1. AFWMTS, Germany & TU Berlin AI, Germany
Abstract
This author has for the past decade developed a mathematical basis for product languages, at times with colleagues, applying agent crypto-signatures to authenticate business process models. This chapter is the newest application for what is at recent times called block chain. A new algebraic tree based public key cryptography techniques and algorithm for crypto-signatured block chain processing is presented. The techniques apply agent crypto-signatured algebras and block product language signatures for an agenda-based block chain protocol. An algorithm with a new public key computable trust model for signature tree block parties accomplishes the block chain goals.
Reference32 articles.
1. A Preliminary Block Chain Protocol Language Cyrus F Nourani Group Technical brief. (2018). TU Berlin.
2. Athey, C. (2017). The Digital Privacy Paradox: Small Money, Small Costs, Small Talk. Retrieved from https://papers.ssrn.com/sol3/papers2.cfm?abstract_id=2916489
3. Brazier, F. M. T., Dunin-Keplicz, B., Jennings, N. R., & Treur, J. (1997). DESIRE: modeling mulch-agent systems in a compositional formal framework. International Journal of Cooperative Information Systems, 1(152).
4. Burkhard, H. D. (1994). On Fair Controls in Multi-Agent Systems. ECAI 1994,11th European Conference on Artificial Intelligence, 254-258.
5. Cachin, Andrulaki, & Osboren. (2016). Blockchain, cryptography, and Consensus. IBM Zürich.