Secure Hash-and-Sign Signatures Without the Random Oracle

DOI10.1007/3-540-48910-X_9zbMath1038.94533MaRDI QIDQ4250758

Rosario Gennaro, Tal Rabin, Shai Halevi

Publication date: 1999

Published in: Advances in Cryptology — EUROCRYPT ’99 (Search for Journal in Brave)

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (46)

Two-Dimensional Representation of Cover Free Families and Its Applications: Short Signatures and More ⋮ Tightly secure signatures and public-key encryption ⋮ Tightly secure signatures from lossy identification schemes ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ 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 new definition of homomorphic signature for identity management in mobile cloud computing ⋮ The random oracle model: a twenty-year retrospective ⋮ Explainable arguments ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Threshold proxy re-signature ⋮ Locally verifiable signature and key aggregation ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Short signatures without random oracles and the SDH assumption in bilinear groups ⋮ Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction ⋮ How (not) to design strong-RSA signatures ⋮ Fair exchange of valuable information: a generalised framework ⋮ Incrementally aggregatable vector commitments and applications to verifiable decentralized storage ⋮ Programmable hash functions and their applications ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Атаки на схемы электронной подписи, не учитываемые традиционными определениями стойкости, и меры противодействия им ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Efficient digital signatures from RSA without random oracles ⋮ Efficient certificateless threshold signatures without random oracles ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Generic security-amplifying methods of ordinary digital signatures ⋮ Programmable Hash Functions and Their Applications ⋮ Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures ⋮ Asymptotically Efficient Lattice-Based Digital Signatures ⋮ Faster and Shorter Password-Authenticated Key Exchange ⋮ Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography ⋮ Tight security for signature schemes without random oracles ⋮ Proxy Re-signature Schemes Without Random Oracles ⋮ Statistically Hiding Sets ⋮ Short Redactable Signatures Using Random Trees ⋮ Realizing Hash-and-Sign Signatures under Standard Assumptions ⋮ Reducing the Complexity in the Distributed Computation of Private RSA Keys ⋮ New RSA-Based (Selectively) Convertible Undeniable Signature Schemes ⋮ A Storage Efficient Redactable Signature in the Standard Model ⋮ New approaches for deniable authentication ⋮ How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions ⋮ Generic groups, collision resistance, and ECDSA ⋮ Sanitizable Signatures ⋮ Authenticated hash tables based on cryptographic accumulators

This page was built for publication: Secure Hash-and-Sign Signatures Without the Random Oracle