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 mac...

Full description

Saved in:
Bibliographic Details
Published in:Cybernetics and systems analysis 2018-02, Vol.54 (1), p.1-10
Main Authors: Anisimov, A. V., Novokshonov, A. K.
Format: Article
Language:English
Subjects:
Addition & subtraction
Arithmetic
Artificial Intelligence
Control
Cybernetics
Digital signatures
Division
Mathematics
Mathematics and Statistics
Processor Architectures
Program verification (computers)
Software Engineering/Programming and Operating Systems
Subtraction
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1060-0396
1573-8337
DOI:10.1007/s10559-018-0002-7