The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Can D.S.A. be improved? — Complexity trade-offs with the digital signature standard —
Open accessAbstract
The Digital Signature Algorithm (DSA) was proposed in 1991 by the US National Institute of Standards and Technology to provide an appropriate core for applications requiring digital signatures. Undoubtedly, many applications will include this standard in the future and thus, the foreseen domination of DSA as a legal certification tool is sufficiently important to focus research endeavours on the suitability of this scheme to various situations. In this paper, we present six new DSA-based protocols for: Performing a quick batch-verification of n signatures. The proposed scheme allows to make the economy of ≈ 450 n modular multiplications. Avoiding the cumbersome calculation of 1 / k mod q by the signer. Compressing sets of DSA transactions into shorter archive signatures . Generating signatures from pre-calculated “Use & Throw” 224-bit signature-coupons . Self-certifying the moduli and bit-patterning directly q on p (gain of 60.4% in key size). All our schemes combine in a natural way full DSA compatibility and flexible trade-offs between computational complexity, transmission overheads and key sizes. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Cited by
An Efficient Identity-Based Batch Verification Scheme for Vehicular Sensor Networks
Zhang, C., Lu, R., Lin, X., Ho, P.-H., & Shen, X. (2008) · IEEE INFOCOM 2008 - The 27th Conference on Computer Communications · doi:10.1109/infocom.2008.58 · Cited by 667
High-speed high-security signatures
Bernstein, D. J., Duif, N., Lange, T., Schwabe, P., & Yang, B.-Y. (2012) · Journal of Cryptographic Engineering · doi:10.1007/s13389-012-0027-1 · Cited by 541
Fast batch verification for modular exponentiation and digital signatures
Bellare, M., Garay, J. A., & Rabin, T. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054130 · Cited by 443
Authentication and integrity in outsourced databases
Mykletun, E., Narasimha, M., & Tsudik, G. (2006) · ACM Transactions on Storage · doi:10.1145/1149976.1149977 · Cited by 382
Efficient, Compromise Resilient and Append-Only Cryptographic Schemes for Secure Audit Logging
Yavuz, A. A., Ning, P., & Reiter, M. K. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32946-3_12 · Cited by 53
Metadata
- Authors
- Naccache, D., M'RaÏhi, D., Vaudenay, S., & Raphaeli, D.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1995
- Pages
- 77-85
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1569543440
- Cited by
- 165
- References
- 1
- FWCI
- 4.45
- Type
- conference paper
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.