A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
Two remarks concerning the Goldwasser-Micali-Rivest signature scheme
Proceedings on Advances in cryptology---CRYPTO '86
A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A discrete logarithm implementation of perfect zero-knowledge blobs
Journal of Cryptology
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A Forward-Secure Digital Signature Scheme
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
How To Sign Given Any Trapdoor Function
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Existentially Unforgeable Signature Scheme and its Applications
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Escure Signature Schemes based on Interactive Protocols
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
New Generation of Secure and Practical RSA-Based Signatures
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
Journal of Cryptology
Efficient Signature Schemes with Tight Reductions to the Diffie-Hellman Problems
Journal of Cryptology
Trapdoors for hard lattices and new cryptographic constructions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Realizing Hash-and-Sign Signatures under Standard Assumptions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Riemann's hypothesis and tests for primality
Journal of Computer and System Sciences
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
A signature scheme with efficient protocols
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Realizing Hash-and-Sign Signatures under Standard Assumptions
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
A Storage Efficient Redactable Signature in the Standard Model
ISC '09 Proceedings of the 12th International Conference on Information Security
How to Prove Security of a Signature with a Tighter Security Reduction
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Twin Signature Schemes, Revisited
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Synchronized aggregate signatures: new definitions, constructions and applications
Proceedings of the 17th ACM conference on Computer and communications security
A framework for constructing convertible undeniable signatures
ProvSec'10 Proceedings of the 4th international conference on Provable security
Practical adaptive oblivious transfer from simple assumptions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Controversy corner: Improving security of q-SDH based digital signatures
Journal of Systems and Software
Online/offline verification of short signatures
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Authenticating strangers in Online Social Networks
International Journal of Security and Networks
Bonsai trees, or how to delegate a lattice basis
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
A new RSA-based signature scheme
AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
Efficient CCA-Secure PKE from identity-based techniques
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Short signatures from weaker assumptions
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
All-But-Many lossy trapdoor functions
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Strong security from probabilistic signature schemes
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Space efficient signature schemes from the RSA assumption
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Improved security for linearly homomorphic signatures: a generic framework
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Proceedings of the 2012 ACM conference on Computer and communications security
A new hash-and-sign approach and structure-preserving signatures from DLIN
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
On the security of two multi-use CCA-secure proxy re-encryption schemes
International Journal of Intelligent Information and Database Systems
| Hi-index | 0.02 |
Currently, there are relatively few instances of "hash-and-sign" signatures in the standard model. Moreover, most current instances rely on strong and less studied assumptions such as the Strong RSA and q -Strong Diffie-Hellman assumptions. In this paper, we present a new approach for realizing hash-and-sign signatures in the standard model. In our approach, a signer associates each signature with an index i that represents how many signatures that signer has issued up to that point. Then, to make use of this association, we create simple and efficient techniques that restrict an adversary which makes q signature requests to forge on an index no greater than $2^{\lceil \lg(q) \rceil} . Finally, we develop methods for dealing with this restricted adversary. Our approach requires that a signer maintains a small amount of state -- a counter of the number of signatures issued. We achieve two new realizations for hash-and-sign signatures respectively based on the RSA assumption and the Computational Diffie-Hellman assumption in bilinear groups.