Skip to main content
Conference ProceedingsOPEN ACCESS

Short discreet proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1070 131-142
DOI: 10.1007/3-540-68339-9_12
10Citations
Citations of this article
36Readers
Mendeley users who have this article in their library.

Abstract

We show how to produce short proofs of theorems such that a distrusting Verifier can be convinced that the theorem is true yet obtains no information about the proof itself. The proofs are non-interactive pro- vided that the quadratic residuosity bit commitment scheme is available to the Prover and Verifier. For typical applications, the proofs are short enough to fit on a floppy disk.

Cite

CITATION STYLE

APA

Boyar, J., & Peralta, R. (1996). Short discreet proofs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1070, pp. 131–142). Springer Verlag. https://doi.org/10.1007/3-540-68339-9_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free