Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent
- 18 May 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 228-245
- https://doi.org/10.1007/3-540-48071-4_16
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Multiple non-interactive zero knowledge proofs based on a single random stringPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge ProofsPublished by Springer Science and Business Media LLC ,2001
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- A hard-core predicate for all one-way functionsPublished by Association for Computing Machinery (ACM) ,1989
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- 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