A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A "Paradoxical" Solution To The Signature Problem
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
How To Construct Randolli Functions
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Subliminal-free authentication and signature
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
When won't membership queries help?
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A remark on signature scheme where forgery can be proved
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On-line/off-line digital signatures
CRYPTO '89 Proceedings on Advances in cryptology
Evaluation may be easier than generation (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
How To Break and Repair A "Provably Secure" Untraceable Payment System
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provably Unforgeable Signatures
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
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
A New Forward-Secure Digital Signature Scheme
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Improving the Exact Security of Fiat-Shamir Signature Schemes
Proceedings of the International Exhibition and Congress on Secure Networking - CQRE (Secure) '99
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Number-theoretic constructions of efficient pseudo-random functions
Journal of the ACM (JACM)
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
Efficient pseudorandom functions from the decisional linear assumption and weaker variants
Proceedings of the 16th ACM conference on Computer and communications security
Collision free hash functions and public key signature schemes
EUROCRYPT'87 Proceedings of the 6th annual international conference on Theory and application of cryptographic techniques
Access control using pairing based cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
One-time signatures and Chameleon hash functions
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
How (Not) to design strong-RSA signatures
Designs, Codes and Cryptography
Justifying a dolev-yao model under active attacks
Foundations of Security Analysis and Design III
Group signature revocable anonymity scheme for network monitoring
Annales UMCS, Informatica - Security Systems
Unlinkability of sanitizable signatures
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Confidential signatures and deterministic signcryption
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Strongly unforgeable signatures based on computational diffie-hellman
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
A practical and tightly secure signature scheme without hash function
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Hardness preserving constructions of pseudorandom functions
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
| Hi-index | 0.00 |
The focus of this note is the Goldwasser-Micali-Rivest Signature Scheme (presented in the 25th FOCS, 1984). The GMR scheme has the salient property that, unless factoring is easy, it is infeasible to forge any signature even through an adaptive chosen message attack. We present two technical contributions with respect to the GMR scheme: 1) The GMR scheme can be made totally "memoryless": That is, the signature generated by the signer on message M does not depend on the previous signed messages. (In the original scheme, the signature to a message depends on the number of messages signed before.) 2) The GMR scheme can be implemented almost as efficiently as the RSA: The original implementation of the GMR scheme based on factoring, can be speeded-up by a factor of |N|. Thus, both signing and verifying take time O (|N| 3log2 |N|). (Here N is the moduli.).