Necessary and Sufficient Assumptions for Non-interactive Zero-Knowledge Proofs of Knowledge for All NP Relations
- 1 January 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 451-462
- https://doi.org/10.1007/3-540-45022-x_38
Abstract
No abstract availableKeywords
This publication has 20 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
- On Concurrent Zero-Knowledge with Pre-processingLecture Notes in Computer Science, 1999
- Non-interactive and non-malleable commitmentPublished by Association for Computing Machinery (ACM) ,1998
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Non-interactive zero-knowledge and its applicationsPublished by Association for Computing Machinery (ACM) ,1988
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- New directions in cryptographyIEEE Transactions on Information Theory, 1976