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

Giovanni Di Crescenzo; Kouichi Sakurai; Moti Yung

doi:10.1007/3-540-49381-6_8

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

Giovanni Di Crescenzo, Kouichi Sakurai, Moti Yung

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings
Publisher	Springer Verlag
Pages	59-71
Number of pages	13
ISBN (Print)	3540653856, 9783540653851
DOIs	https://doi.org/10.1007/3-540-49381-6_8
Publication status	Published - 1998
Event	9th Annual International Symposium on Algorithms and Computation, ISAAC'98 - Taejon, Korea, Republic of Duration: Dec 14 1998 → Dec 16 1998

Publication series

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

Other

Other	9th Annual International Symposium on Algorithms and Computation, ISAAC'98
Country/Territory	Korea, Republic of
City	Taejon
Period	12/14/98 → 12/16/98

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-49381-6_8

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). Springer Verlag. https://doi.org/10.1007/3-540-49381-6_8

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. Springer Verlag, 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 proceeding › Conference 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, Springer Verlag, pp. 59-71, 9th Annual International Symposium on Algorithms and Computation, ISAAC'98, Taejon, Korea, Republic of, 12/14/98. https://doi.org/10.1007/3-540-49381-6_8

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. Springer Verlag. 1998. p. 59-71. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-49381-6_8

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. Springer Verlag, 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",

doi = "10.1007/3-540-49381-6_8",

language = "English",

isbn = "3540653856",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "59--71",

booktitle = "Algorithms and Computation - 9th International Symposium, ISAAC'98, Proceedings",

address = "Germany",

note = "9th Annual International Symposium on Algorithms and Computation, ISAAC'98 ; Conference date: 14-12-1998 Through 16-12-1998",

}

TY - GEN

T1 - Checking programs discreetly

T2 - 9th Annual International Symposium on Algorithms and Computation, ISAAC'98

AU - Di Crescenzo, Giovanni

AU - Sakurai, Kouichi

AU - Yung, Moti

PY - 1998

Y1 - 1998

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

U2 - 10.1007/3-540-49381-6_8

DO - 10.1007/3-540-49381-6_8

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

PB - Springer Verlag

Y2 - 14 December 1998 through 16 December 1998

ER -

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

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this