A theory of demonstrating program result-correctness with cryptographic applications

Research output: Contribution to journalArticle

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 languageEnglish
Pages (from-to)4-14
Number of pages11
JournalIEICE Transactions on Information and Systems
VolumeE84-D
Issue number1
Publication statusPublished - 2001

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'A theory of demonstrating program result-correctness with cryptographic applications'. Together they form a unique fingerprint.

  • Cite this