On the Instantiability of Hash-and-Sign RSA Signatures

DOI10.1007/978-3-642-28914-9_7zbMath1303.94078OpenAlexW1601106539MaRDI QIDQ2891479

Iftach Haitner, Aris Tentes, Yevgeniy Dodis

Publication date: 15 June 2012

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-28914-9_7

zbMATH Keywords

Black-Box ReductionsFull Domain HashGeneric GroupsHash-and-SignRandom Oracle HeuristicRSA Signature

Mathematics Subject Classification ID

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

Related Items (10)

Toward RSA-OAEP Without Random Oracles ⋮ Single-server private information retrieval with sublinear amortized time ⋮ On the complexity of collision resistant hash functions: new and old black-box separations ⋮ On tight security proofs for Schnorr signatures ⋮ The Kernel Matrix Diffie-Hellman Assumption ⋮ Random oracle combiners: breaking the concatenation barrier for collision-resistance ⋮ Structure Versus Hardness Through the Obfuscation Lens ⋮ Linicrypt: A Model for Practical Cryptography ⋮ Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing

This page was built for publication: On the Instantiability of Hash-and-Sign RSA Signatures