New Generation of Secure and Practical RSA-Based Signatures

DOI10.1007/3-540-68697-5_14zbMath1329.94058OpenAlexW2145301648MaRDI QIDQ3452350

Ronald Cramer, Ivan B. Damgård

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_14

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Complete Problem for Perfect Zero-Knowledge Quantum Proof, 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, Key regeneration-free ciphertext-policy attribute-based encryption and its application, Short signatures from Diffie-Hellman: realizing almost compact public key, A generic construction of tightly secure signatures in the multi-user setting, Locally verifiable signature and key aggregation, How (not) to design strong-RSA signatures, Efficient digital signatures from RSA without random oracles, Fine-grained forward-secure signature schemes without random oracles, Confined guessing: new signatures from standard assumptions, Zero-Knowledge Sets with Short Proofs, Realizing Hash-and-Sign Signatures under Standard Assumptions, Verifiable random functions with optimal tightness, A Storage Efficient Redactable Signature in the Standard Model, New approaches for deniable authentication, Tightly secure signature schemes from the LWE and subset sum assumptions

Cites Work

• Efficient signature generation by smart cards
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item