A theory of demonstrating program result-correctness with cryptographic applications

研究成果: Contribution to journalArticle査読

抄録

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.

本文言語英語
ページ(範囲)4-14
ページ数11
ジャーナルIEICE Transactions on Information and Systems
E84-D
1
出版ステータス出版済み - 2001

All Science Journal Classification (ASJC) codes

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

フィンガープリント 「A theory of demonstrating program result-correctness with cryptographic applications」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル