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
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Universal one-way hash functions and their cryptographic applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Witness indistinguishable and witness hiding protocols
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An interactive identification scheme based on discrete logarithms and factoring
Journal of Cryptology - Eurocrypt '90
A Digital Signature Based on a Conventional Encryption Function
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On Generating Solved Instances of Computational Problems
CRYPTO '88 Proceedings of the 8th 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
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
On shared randomness and the size of secure signatures
On shared randomness and the size of secure signatures
Random self-reducibility and zero knowledge interactive proofs of possession of information
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
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
New Generation of Secure and Practical RSA-Based Signatures
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: 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
A composable cryptographic library with nested operations
Proceedings of the 10th ACM conference on Computer and communications security
Fine-grained forward-secure signature schemes without random oracles
Discrete Applied Mathematics - Special issue: Coding and cryptography
Cramer-Damgård signatures revisited: Efficient flat-tree signatures based on factoring
Theoretical Computer Science
Unlinkable Randomizable Signature and Its Application in Group Signature
Information Security and Cryptology
An Identification Scheme with Tight Reduction
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
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
Signature Schemes with Bounded Leakage Resilience
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Fine-grained forward-secure signature schemes without random oracles
Discrete Applied Mathematics - Special issue: Coding and cryptography
Fast and secure immunization against adaptive man-in-the-middle impersonation
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Two-tier signatures, strongly unforgeable signatures, and Fiat-Shamir without random oracles
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Access control using pairing based cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Generic security-amplifying methods of ordinary digital signatures
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Cramer-Damgård signatures revisited: efficient flat-tree signatures based on factoring
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
Justifying a dolev-yao model under active attacks
Foundations of Security Analysis and Design III
Generic security-amplifying methods of ordinary digital signatures
Information Sciences: an International Journal
| Hi-index | 0.00 |
Given only an interactive protocol of a certain type as a primitive, we can build a (non-interactive) signature scheme that is secure in the strongest sense of Goldwasser, Micali and Rivest (see [11]): not existentially forgeable under adaptively chosen message attacks. There are numerous examples of primitives that satisfy our conditions, e.g. Feige-Fiat-Shamir, Schnorr, Guillou-Quisquater, Okamoto and Brickell-Mc.Curley ([9], [17], [12], [15], [3]).A main consequence is that efficient and secure signature schemes can now also be based on computationally difficult problems other than factoring (see [11]), such as the discrete logarithm problem.In fact, the existence of one-way group homomorphisms is a sufficient assumption to support our construction. As we also demonstrate that our construction can be based on claw-free pairs of trapdoor permutations, our results can be viewed as a generalization of [11].