A Signature Scheme with Efficient Protocols
Top Cited Papers
- 14 March 2003
- book chapter
- Published by Springer Nature
- p. 268-289
- https://doi.org/10.1007/3-540-36413-7_20
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Efficient group signature schemes for large groupsPublished by Springer Nature ,1997
- Statistical zero knowledge protocols to prove modular polynomial relationsPublished by Springer Nature ,1997
- Access with pseudonymsPublished by Springer Nature ,1996
- Minimum disclosure proofs of knowledgeJournal of Computer and System Sciences, 1988
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message AttacksSIAM Journal on Computing, 1988
- On the generation of cryptographically strong pseudorandom sequencesACM Transactions on Computer Systems, 1983
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- New directions in cryptographyIEEE Transactions on Information Theory, 1976