Secure Hash-and-Sign Signatures Without the Random Oracle
From MaRDI portal
Recommendations
Cited in
(83)- New approaches for deniable authentication
- Homomorphic signatures with sublinear public keys via asymmetric programmable hash functions
- Analysis of a proposed hash-based signature standard
- Security analysis of randomize-hash-then-sign digital signatures
- Threshold proxy re-signature
- Subversion-resilient signatures: definitions, constructions and applications
- Efficient digital signatures from RSA without random oracles
- SoK: comparison of the security of real world RSA hash-and-sign signatures
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
- Intrusion-resilient identity-based signatures: concrete scheme in the standard model and generic construction
- Short signatures from Diffie-Hellman: realizing almost compact public key
- Short signatures without random oracles and the SDH assumption in bilinear groups
- How (not) to design strong-RSA signatures
- Tight security for signature schemes without random oracles
- Generic groups, collision resistance, and ECDSA
- An improved signature scheme without using one-way hash functions
- Authenticated hash tables based on cryptographic accumulators
- Key regeneration-free ciphertext-policy attribute-based encryption and its application
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Algebraic partitioning: fully compact and (almost) tightly secure cryptography
- Security proofs for signature schemes
- Two-dimensional representation of cover free families and its applications: short signatures and more
- On the instantiability of hash-and-sign RSA signatures
- Strong security from probabilistic signature schemes
- Tightly-Secure Signatures from Chameleon Hash Functions
- Bounded Pre-image Awareness and the Security of Hash-Tree Keyless Signatures
- Towards tightly secure lattice short signature and id-based encryption
- Tightly secure signatures and public-key encryption
- A signature scheme with efficient proof of validity
- Tightly secure signatures from lossy identification schemes
- How Risky Is the Random-Oracle Model?
- Security analysis of the Gennaro-Halevi-Rabin signature scheme
- A Storage Efficient Redactable Signature in the Standard Model
- New generation of secure and practical RSA-based signatures
- Black-box separations of hash-and-sign signatures in the non-programmable random oracle model
- A CDH-Based Strongly Unforgeable Signature Without Collision Resistant Hash Function
- Digital Signatures Out of Second-Preimage Resistant Hash Functions
- A new RSA-based signature scheme
- A Generic Construction of Secure Signatures Without Random Oracles
- Programmable Hash Functions and Their Applications
- Hash-and-Sign with Weak Hashing Made Secure
- Statistically Hiding Sets
- Short Redactable Signatures Using Random Trees
- On Randomizing Hash Functions to Strengthen the Security of Digital Signatures
- Realizing Hash-and-Sign Signatures under Standard Assumptions
- Hash function requirements for Schnorr signatures
- Reducing the Complexity in the Distributed Computation of Private RSA Keys
- New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
- A new definition of homomorphic signature for identity management in mobile cloud computing
- scientific article; zbMATH DE number 1304109 (Why is no real title available?)
- Programmable hash functions and their applications
- scientific article; zbMATH DE number 1942447 (Why is no real title available?)
- scientific article; zbMATH DE number 2079916 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- Concurrent signature without random oracles
- W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
- Attacks on digital signature schemes not accounted by the common security definitions, and countermeasures
- A Practical and Tightly Secure Signature Scheme Without Hash Function
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures
- Security of Digital Signature Schemes in Weakened Random Oracle Models
- Asymptotically Efficient Lattice-Based Digital Signatures
- Faster and Shorter Password-Authenticated Key Exchange
- Efficient certificateless threshold signatures without random oracles
- Proxy Re-signature Schemes Without Random Oracles
- Information Security
- How to Use Merkle-Damgård — On the Security Relations between Signature Schemes and Their Inner Hash Functions
- Strengthening Digital Signatures Via Randomized Hashing
- Sanitizable signatures
- Cryptography and Coding
- Public Key Cryptography - PKC 2006
- Explainable arguments
- Zero-knowledge proofs for set membership: efficient, succinct, modular
- Locally verifiable signature and key aggregation
- Inner product functional commitments with constant-size public parameters and openings
- Fair exchange of valuable information: a generalised framework
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- Homomorphic encryption for large integers from nested residue number systems
- Public-algorithm substitution attacks: subverting hashing and verification
- Non-malleable subvector commitments
- Generic security-amplifying methods of ordinary digital signatures
- Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
- The random oracle model: a twenty-year retrospective
This page was built for publication: Secure Hash-and-Sign Signatures Without the Random Oracle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250758)
