Formal Security Proofs for a Signature Scheme with Partial Message Recovery
- 2 April 2001
- book chapter
- Published by Springer Nature
- p. 126-142
- https://doi.org/10.1007/3-540-45353-9_11
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- A Signature Scheme with Message Recovery as Secure as Discrete LogarithmPublished by Springer Nature ,1999
- The random oracle methodology, revisited (preliminary version)Published by Association for Computing Machinery (ACM) ,1998
- A practical public key cryptosystem provably secure against adaptive chosen ciphertext attackPublished by Springer Nature ,1998
- Security amplification by composition: The case of doubly-iterated, ideal ciphersPublished by Springer Nature ,1998
- Lower Bounds for Discrete Logarithms and Related ProblemsPublished by Springer Nature ,1997
- Collision-Resistant hashing: Towards making UOWHFs practicalPublished by Springer Nature ,1997
- The Exact Security of Digital Signatures-How to Sign with RSA and RabinPublished by Springer Nature ,1996
- Security Proofs for Signature SchemesPublished by Springer Nature ,1996
- Random oracles are practicalPublished by Association for Computing Machinery (ACM) ,1993
- Universal one-way hash functions and their cryptographic applicationsPublished by Association for Computing Machinery (ACM) ,1989