A discrete logarithm implementation of perfect zero-knowledge blobs
- 1 January 1990
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 2 (2) , 63-76
- https://doi.org/10.1007/bf00204448
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Inferring sequences produced by pseudo-random number generatorsJournal of the ACM, 1989
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- Cryptanalysis: a survey of recent resultsProceedings of the IEEE, 1988
- How to Generate Factored Random NumbersSIAM Journal on Computing, 1988
- Completeness theorems for non-cryptographic fault-tolerant distributed computationPublished by Association for Computing Machinery (ACM) ,1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Recognizing primes in random polynomial timePublished by Association for Computing Machinery (ACM) ,1987
- Non-transitive transfer of confidence: A perfect zero-knowledge interactive protocol for SAT and beyondPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Trading group theory for randomnessPublished by Association for Computing Machinery (ACM) ,1985
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984