The Cramer-Shoup Strong-RSA Signature Scheme Revisited
From MaRDI portal
Recommendations
Cited in
(20)- Subversion-resilient signatures: definitions, constructions and applications
- Efficient digital signatures from RSA without random oracles
- Confined guessing: new signatures from standard assumptions
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Short signatures without random oracles and the SDH assumption in bilinear groups
- How (not) to design strong-RSA signatures
- Fine-grained forward-secure signature schemes without random oracles
- Tight security for signature schemes without random oracles
- Two-dimensional representation of cover free families and its applications: short signatures and more
- Towards tightly secure lattice short signature and id-based encryption
- Programmable Hash Functions and Their Applications
- Programmable hash functions and their applications
- A modification of the Cramer-Shoup digital signature scheme
- An Efficient On-Line/Off-Line Signature Scheme without Random Oracles
- Public Key Cryptography - PKC 2005
- \(k\)-critical graphs in \(P_5\)-free graphs
- Locally verifiable signature and key aggregation
- Pairing-free blind signatures from standard assumptions in the ROM
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
This page was built for publication: The Cramer-Shoup Strong-RSA Signature Scheme Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414702)
