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

Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings
Pages59-71
Number of pages13
Publication statusPublished - Dec 1 1998
Event9th Annual International Symposium on Algorithms and Computation, ISAAC'98 - Taejon, Korea, Republic of
Duration: Dec 14 1998Dec 16 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1533 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th Annual International Symposium on Algorithms and Computation, ISAAC'98
CountryKorea, Republic of
CityTaejon
Period12/14/9812/16/98

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it'. Together they form a unique fingerprint.

  • Cite this

    Di Crescenzo, G., Sakurai, K., & Yung, M. (1998). Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it. In 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); Vol. 1533 LNCS).