Доверительные вычисления с использованием складывающей машины. II / Анисимов А. В., Новокшонов А. К. (2018)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2018, 54 (1))

Anisimov A.V., Novokshonov A.K.
Trusted computing with addition machines. II

A solution to the integrity verification problem is proposed for arithmetic programs with branching and looping statements executed on a remote computational resource. The solution is to replace arithmetic operations such as multiplication and division by corresponding procedures of the addition machine introduced by R. Floyd and D. Knuth. Instruction sequencing and current values of variables are signed by dynamic digital signatures homomorphic with respect to addition and subtraction. A modification of the Benaloh scheme is used for the implementation of digital signatures. Verification of digital signatures of the results of executing a program ensures the detection of any unauthorized changes in the source code of the program. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: addition machine, digital signature, homomorphic cryptography, verifiable computing, Authentication, Electronic document identification systems, Arithmetic operations, Computational resources, Current values, Homomorphic cryptography, Integrity verifications, Source codes, verifiable computing, Trusted computing


Cite:
Anisimov A.V., Novokshonov A.K. (2018). Trusted computing with addition machines. II. Cybernetics and Systems Analysis, 54 (1), 3-12. doi: https://doi.org/10.1007/s10559-018-0002-7 http://jnas.nbuv.gov.ua/article/UJRN-0000805853 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна