Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)

Abstract

The standard deenition 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. MIT.

DOI: 10.1007/3-540-48071-4_16

Statistics

051015'03'05'07'09'11'13'15'17
Citations per Year

57 Citations

Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Goldwasser1992InvariantSA, title={Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)}, author={Shafi Goldwasser and Rafail Ostrovsky}, booktitle={CRYPTO}, year={1992} }