Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently while Concealing it

Authors:
Giovanni Di Crescenzo;Kouichi Sakurai;Moti Yung
Affiliations:
-;-;-
Venue:
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Year:
1998

Citing 25
Cited 0

The complexity of perfect zero-knowledge

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Zero-knowledge proofs of identity

Journal of Cryptology
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
On hiding information form an oracle

Journal of Computer and System Sciences
Minimum-knowledge interactive proofs for decision problems

SIAM Journal on Computing
Designing programs that check their work

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Statistical zero-knowledge languages can be recognized in two rounds

Journal of Computer and System Sciences
Zero-knowledge proofs of computational power (extended summary)

EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Journal of the ACM (JACM)
Quantifying knowledge complexity

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Making zero-knowledge provers efficient

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The graph isomorphism problem: its structural complexity

The graph isomorphism problem: its structural complexity
A low communication competitive interactive proof system for promised quadratic residuosity

CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
How to share a function securely

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Witness-based cryptographic program checking and robust function sharing

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Zero-knowledge proofs of decision power: new protocols and optimal round-complexity

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Result-Indistinguishable Zero-Knowledge Proofs: Increased Power and Constant-Round Protocols

STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Direct Minimum-Knowledge Computations

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Everything Provable is Provable in Zero-Knowledge

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Hiding Instances in Zero-Knowledge Proof Systems (Extended Abstract)

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
On Defining Proofs of Knowledge

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Algebraic methods for interactive proof systems

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Nondeterministic exponential time has two-prover interactive protocols

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
A characterization of Hash P by arithmetic straight line programs

SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.