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 -