Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it

Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

1 引用 (Scopus)

抜粋

We formalize and investigate a model for zero-knowledge proofs of "program result-correctness", 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.

元の言語英語
ホスト出版物のタイトルAlgorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings
出版者Springer Verlag
ページ59-71
ページ数13
ISBN(印刷物)3540653856, 9783540653851
DOI
出版物ステータス出版済み - 1998
イベント9th Annual International Symposium on Algorithms and Computation, ISAAC'98 - Taejon, 大韓民国
継続期間: 12 14 199812 16 1998

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1533 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他9th Annual International Symposium on Algorithms and Computation, ISAAC'98
大韓民国
Taejon
期間12/14/9812/16/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Di Crescenzo, G., Sakurai, K., & Yung, M. (1998). Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it. : Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings (pp. 59-71). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 1533 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-49381-6_8