Affiliation:
1. Aarhus Univ., Aarhus, Denmark
2. IBM Zurich Research Lab, Zurich, Switzerland
Abstract
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the signer to maintain any state, and can be proven secure against adaptive chosen message attack under a reasonable intractability assumption, the so-called strong RSA assumption. Moreover, a hash function can be incorporated into the scheme in such a way that it is also secure in the random oracle model under the standard RSA assumption.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,General Computer Science
Cited by
174 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster Cryptographic Hash Function from Supersingular Isogeny Graphs;Lecture Notes in Computer Science;2024
2. Elliptic curves over a finite ring;Annals of the University of Craiova Mathematics and Computer Science Series;2023-12-18
3. Partial message verification in fog-based industrial Internet of things;Computers & Security;2023-12
4. EESMR;Proceedings of the 24th International Middleware Conference on ZZZ;2023-11-27
5. Generalized Fibonacci Sequences for Elliptic Curve Cryptography;Mathematics;2023-11-15