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

Fingerprint

Zero-knowledge
Correctness
Zero-knowledge Proof
Alike
Requirements
Model

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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).

Checking programs discreetly : Demonstrating result-correctness efficiently while concealing it. / Di Crescenzo, Giovanni; Sakurai, Kouichi; Yung, Moti.

Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. 1998. p. 59-71 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1533 LNCS).

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

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1533 LNCS, pp. 59-71, 9th Annual International Symposium on Algorithms and Computation, ISAAC'98, Taejon, Korea, Republic of, 12/14/98.
Di Crescenzo G, Sakurai K, Yung M. Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it. In Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. 1998. p. 59-71. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Di Crescenzo, Giovanni ; Sakurai, Kouichi ; Yung, Moti. / Checking programs discreetly : Demonstrating result-correctness efficiently while concealing it. Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings. 1998. pp. 59-71 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9a04ed72bc7f462485a233e9aca32479,
title = "Checking programs discreetly: Demonstrating result-correctness efficiently while concealing it",
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.",
author = "{Di Crescenzo}, Giovanni and Kouichi Sakurai and Moti Yung",
year = "1998",
month = "12",
day = "1",
language = "English",
isbn = "3540653856",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "59--71",
booktitle = "Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings",

}

TY - GEN

T1 - Checking programs discreetly

T2 - Demonstrating result-correctness efficiently while concealing it

AU - Di Crescenzo, Giovanni

AU - Sakurai, Kouichi

AU - Yung, Moti

PY - 1998/12/1

Y1 - 1998/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33746085538&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33746085538&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33746085538

SN - 3540653856

SN - 9783540653851

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 59

EP - 71

BT - Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings

ER -