Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent
Authors:
- Shafi GoldwasserSGShafi Goldwasser
- 18 May 2001
- book chapter
- Published by Springer Nature
- p. 228-245
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Multiple non-interactive zero knowledge proofs based on a single random string2002
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs2001
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A hard-core predicate for all one-way functions1989
- Limits on the provable consequences of one-way permutations1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Non-interactive zero-knowledge and its applications1988
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976