Abstract
We formalize a model of "demonstration of program result-correctness," and investigate how to prove this fact against possible adversaries, which naturally extends Blum's theory of program checking by adding zero-knowledge requirements. The zero-knowledge requirements are universal for yes and no instances alike.
| Original language | English |
|---|---|
| Pages (from-to) | 4-14 |
| Number of pages | 11 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E84-D |
| Issue number | 1 |
| Publication status | Published - 2001 |
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence