A Theory of Demonstrating Program Result-Correctness with Cryptographic Applications
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E84-D No.1 pp.4-14
- Publication Date
- 2001/01/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
