Publication Details
Title: Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent
Author: S. Goldwasser and R. Ostrovsky
Group: ICSI Technical Reports
Date: December 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-083.pdf
Overview:
The standard definition of digital signatures allows a document to have many valid signatures. In this paper, we consider a subclass of digital signatures, called invariant signatures, in which all legal signatures of a document must be identical according to some polynomial-time computable function (of a signature) which is hard to predict given an unsigned document. We formalize this notion and show its equivalence to non-interactive zero-knowledge proofs.
Bibliographic Information:
ICSI Technical Report TR-92-083
Bibliographic Reference:
S. Goldwasser and R. Ostrovsky. Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent. ICSI Technical Report TR-92-083, December 1992
Author: S. Goldwasser and R. Ostrovsky
Group: ICSI Technical Reports
Date: December 1992
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1992/tr-92-083.pdf
Overview:
The standard definition of digital signatures allows a document to have many valid signatures. In this paper, we consider a subclass of digital signatures, called invariant signatures, in which all legal signatures of a document must be identical according to some polynomial-time computable function (of a signature) which is hard to predict given an unsigned document. We formalize this notion and show its equivalence to non-interactive zero-knowledge proofs.
Bibliographic Information:
ICSI Technical Report TR-92-083
Bibliographic Reference:
S. Goldwasser and R. Ostrovsky. Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent. ICSI Technical Report TR-92-083, December 1992