Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent
Title | Invariant Signatures and Non-Interactive Zero-Knowledge Proofs Are Equivalent |
Publication Type | Technical Report |
Year of Publication | 1992 |
Authors | Goldwasser, S., & Ostrovsky R. |
Other Numbers | 788 |
Abstract | 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. |
URL | http://www.icsi.berkeley.edu/ftp/global/pub/techreports/1992/tr-92-083.pdf |
Bibliographic Notes | ICSI Technical Report TR-92-083 |
Abbreviated Authors | S. Goldwasser and R. Ostrovsky |
ICSI Publication Type | Technical Report |