Realizing Hash-and-Sign Signatures under Standard Assumptions

DOI10.1007/978-3-642-01001-9_19zbMath1239.94075OpenAlexW2141776264MaRDI QIDQ3627443

Brent Waters, Susan Hohenberger

Publication date: 12 May 2009

Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (18)

Generic construction for tightly-secure signatures from discrete log ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Tightly CCA-secure identity-based encryption with ciphertext pseudorandomness ⋮ A generic construction of tightly secure signatures in the multi-user setting ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ Improved proxy re-encryption schemes with applications to secure distributed storage ⋮ A characterization of chameleon hash functions and new, efficient designs ⋮ Subversion-resilient signatures: definitions, constructions and applications ⋮ Efficient digital signatures from RSA without random oracles ⋮ A Framework for Constructing Convertible Undeniable Signatures ⋮ PRE: stronger security notions and efficient construction with non-interactive opening ⋮ Confined guessing: new signatures from standard assumptions ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ A Storage Efficient Redactable Signature in the Standard Model ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Computing on authenticated data ⋮ Adaptive Partitioning

Cites Work

• A discrete logarithm implementation of perfect zero-knowledge blobs
• Probabilistic algorithm for testing primality
• Efficient signature generation by smart cards
• Riemann's hypothesis and tests for primality
• Short signatures from the Weil pairing
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Security Proofs for Signature Schemes
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Short and Stateless Signatures from the RSA Assumption
• New Generation of Secure and Practical RSA-Based Signatures
• Trapdoors for hard lattices and new cryptographic constructions
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Secure Hash-and-Sign Signatures Without the Random Oracle
• Financial Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology – CRYPTO 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Realizing Hash-and-Sign Signatures under Standard Assumptions