Secure Hash-and-Sign Signatures Without the Random Oracle
Authors:
- 15 April 1999
- book chapter
- Published by Springer Nature
- p. 123-139
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products1998
- An Efficient Existentially Unforgeable Signature Scheme and Its ApplicationsJournal of Cryptology, 1998
- New Generation of Secure and Practical RSA-Based Signatures1996
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin1996
- Security Proofs for Signature Schemes1996
- Random oracles are practical1993
- 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
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978