New generation of secure and practical RSA-based signatures
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Efficient signature generation by smart cards
- scientific article; zbMATH DE number 4179279 (Why is no real title available?)
- scientific article; zbMATH DE number 708796 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- Improved privacy in wallets with observers
- New directions in cryptography
- One-way accumulators: A decentralized alternative to digital signatures
- Secure signature schemes based on interactive protocols
Cited in
(37)- New approaches for deniable authentication
- An efficient existentially unforgeable signature scheme and its applications
- Efficient Rabin-type digital signature scheme
- Efficient digital signatures from RSA without random oracles
- Confined guessing: new signatures from standard assumptions
- Verifiable random functions with optimal tightness
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Tightly secure signature schemes from the LWE and subset sum assumptions
- Short signatures from Diffie-Hellman: realizing almost compact public key
- A generic construction of tightly secure signatures in the multi-user setting
- How (not) to design strong-RSA signatures
- Fine-grained forward-secure signature schemes without random oracles
- Key regeneration-free ciphertext-policy attribute-based encryption and its application
- From fixed-length messages to arbitrary-length messages practical RSA signature padding schemes
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- Space efficient signature schemes from the RSA assumption
- A Storage Efficient Redactable Signature in the Standard Model
- Some Remarks about an Electronic Signature Derived from a Generalized RSA-Code
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- How (not) to design RSA signature schemes
- Which new RSA signatures can be computed from some given RSA signatures?
- scientific article; zbMATH DE number 708796 (Why is no real title available?)
- Fast server-aided RSA signatures secure against active attacks
- Practical security in public-key cryptography
- An efficient existentially unforgeable signature scheme and its applications
- On the security of RSA padding
- A modification of the Cramer-Shoup digital signature scheme
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Zero-Knowledge Sets with Short Proofs
- On the security of some variants of the RSA signature scheme
- Cryptography and Coding
- Locally verifiable signature and key aggregation
- Integrity attacks on multi-level secured channels: a structured fusion approach
- Short signatures from DDH without pairings or random oracles
- Proofs of security for improved Rabin signature scheme
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
This page was built for publication: New generation of secure and practical RSA-based signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452350)
