The Cramer-Shoup Strong-RSA Signature Scheme Revisited

DOI10.1007/3-540-36288-6_9zbMath1033.94556OpenAlexW2152521692MaRDI QIDQ4414702

Marc Fischlin

Publication date: 27 July 2003

Published in: Public Key Cryptography — PKC 2003 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-36288-6_9

zbMATH Keywords

signature schemesstrong RSA

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items

Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Locally verifiable signature and key aggregation ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ How (not) to design strong-RSA signatures ⋮ Programmable hash functions and their applications ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Efficient digital signatures from RSA without random oracles ⋮ Fine-grained forward-secure signature schemes without random oracles ⋮ Confined guessing: new signatures from standard assumptions ⋮ Programmable Hash Functions and Their Applications ⋮ \(k\)-critical graphs in \(P_5\)-free graphs ⋮ Tight security for signature schemes without random oracles ⋮ An Efficient On-Line/Off-Line Signature Scheme without Random Oracles