Scalable Verification Of Np Problems In Blockchain

PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON CYBER WARFARE AND SECURITY (ICCWS 2020)(2020)

Cited 0|Views0
No score
Abstract
The integrity of information systems is predicated on the integrity of processes that manipulate data. These processes are conventionally executed using von Neumann architecture, which requires memory to be trusted. This is increasingly unjustifiable due to complex features such as platform virtualization, hyper-threading, etc. In this paper we propose a new model of computing, viz., TCB minimizing model of computation (TMMC), which explicitly seeks to minimize the TCB, viz., hardware and software that need to be trusted. Notwithstanding limitations imposed on the TCB, even complex large-scale processes can be executed under the TMMC model. As a representative of complex processes, we consider the verification of the solution of large-scale NP problems in this paper.
More
Translated text
Key words
trusted computing base, blockchain, NP problems, scalable verification
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined