Impossibility Proofs for RSA Signatures in the Standard Model

DOI10.1007/11967668_3MaRDI QIDQ5385941zbMATH OpenOpenAlexFDO

Authors Pascal Paillier

Publication date 17 April 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11967668_3

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the instantiability of hash-and-sign RSA signatures
• On the impossibility of instantiating PSS in the standard model
• On the impossibility of proving security of strong-RSA signatures via the RSA assumption
• Optimal security proofs for full domain hash, revisited
• Optimal security proofs for full domain hash. Revisited

Cited in

(8)

• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
• How (not) to design strong-RSA signatures
• On the instantiability of hash-and-sign RSA signatures
• On the impossibility of instantiating PSS in the standard model
• Another look at affine-padding RSA signatures
• On the impossibility of proving security of strong-RSA signatures via the RSA assumption
• Random oracle combiners: breaking the concatenation barrier for collision-resistance
• Tightly secure lattice-based synchronized aggregate signature in standard model

This page was built for publication: Impossibility Proofs for RSA Signatures in the Standard Model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385941)