A "Paradoxical" Solution To The Signature Problem
- 1 January 1984
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 441-448
- https://doi.org/10.1109/sfcs.1984.715946
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- An efficient signature scheme based on quadratic equationsPublished by Association for Computing Machinery (ACM) ,1984
- Strong signature schemesPublished by Association for Computing Machinery (ACM) ,1983
- A logarithmic time sort for linear size networksPublished by Association for Computing Machinery (ACM) ,1983
- A polynomial time algorithm for breaking the basic Merkle-Hellman cryptosystemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982
- Uniform complexity and digital signaturesTheoretical Computer Science, 1981
- Digital signatures — An overviewComputer Networks (1976), 1979
- Hiding information and signatures in trapdoor knapsacksIEEE Transactions on Information Theory, 1978
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978