Zero-knowledge proofs for finite field arithmetic, or: Can zero-knowledge be for free?
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 424-441
- https://doi.org/10.1007/bfb0055745
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- How To Construct Constant-Round Zero-Knowledge Proof Systems for NPJournal of Cryptology, 1996
- Subquadratic zero-knowledgeJournal of the ACM, 1995
- IP = PSPACEJournal of the ACM, 1992
- Checking computations in polylogarithmic timePublished by Association for Computing Machinery (ACM) ,1991
- Efficient signature generation by smart cardsJournal of Cryptology, 1991
- The Effect of Computerized Tests on the Performance and Attitudes of College StudentsJournal of Educational Computing Research, 1989
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Transactions on Information Theory, 1985
- New directions in cryptographyIEEE Transactions on Information Theory, 1976