The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 "프로그램 결과 정확성 입증" 모델을 공식화하고 가능한 적에 대해 이 사실을 증명하는 방법을 조사합니다. 이는 영지식 요구 사항을 추가하여 Blum의 프로그램 검사 이론을 자연스럽게 확장합니다. 영지식 요구 사항은 예 및 아니요 인스턴스 모두에 보편적입니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kouichi SAKURAI, "A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 1, pp. 4-14, January 2001, doi: .
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_1_4/_p
부
@ARTICLE{e84-d_1_4,
author={Kouichi SAKURAI, },
journal={IEICE TRANSACTIONS on Information},
title={A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications},
year={2001},
volume={E84-D},
number={1},
pages={4-14},
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.},
keywords={},
doi={},
ISSN={},
month={January},}
부
TY - JOUR
TI - A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications
T2 - IEICE TRANSACTIONS on Information
SP - 4
EP - 14
AU - Kouichi SAKURAI
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 1
JA - IEICE TRANSACTIONS on Information
Y1 - January 2001
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.
ER -