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 - Jan 1 2001

Fingerprint

Demonstrations

All Science Journal Classification (ASJC) codes

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

Cite this

A theory of demonstrating program result-correctness with cryptographic applications. / Sakurai, Kouichi.

In: IEICE Transactions on Information and Systems, Vol. E84-D, No. 1, 01.01.2001, p. 4-14.

Research output: Contribution to journalArticle

@article{75a1a77936934c99aa1eaea72d6c32e3,
title = "A theory of demonstrating program result-correctness with cryptographic applications",
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.",
author = "Kouichi Sakurai",
year = "2001",
month = "1",
day = "1",
language = "English",
volume = "E84-D",
pages = "4--14",
journal = "IEICE Transactions on Information and Systems",
issn = "0916-8532",
publisher = "一般社団法人電子情報通信学会",
number = "1",

}

TY - JOUR

T1 - A theory of demonstrating program result-correctness with cryptographic applications

AU - Sakurai, Kouichi

PY - 2001/1/1

Y1 - 2001/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0035123185&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035123185&partnerID=8YFLogxK

M3 - Article

VL - E84-D

SP - 4

EP - 14

JO - IEICE Transactions on Information and Systems

JF - IEICE Transactions on Information and Systems

SN - 0916-8532

IS - 1

ER -