The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Efficiency improvements for signature schemes with tight security reductions
Abstract
Much recent work has focused on constructing efficient digital signature schemes whose security is tightly related to the hardness of some underlying cryptographic assumption. With this motivation in mind, we show here two approaches which improve both the computational efficiency and signature length of some recently-proposed schemes: Diffie-Hellman signatures. Goh and Jarecki [18] recently analyzed a signature scheme which has a tight security reduction to the computational Diffie-Hellman problem. Unfortunately, their scheme is less efficient in both computation and bandwidth than previous schemes relying on the (related) discrete logarithm assumption. We present a modification of their scheme in which signing is 33% more efficient and signatures are 75% shorter; the security of this scheme is tightly related to the decisional Diffie-Hellman problem. PSS. The...
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_13 · Cited by 7,060
Random oracles are practical: a paradigm for designing efficient protocols
Bellare, M., & Rogaway, P. (1993) · Proceedings of the 1st ACM conference on Computer and communications security - CCS '93 · doi:10.1145/168588.168596 · Cited by 4,712
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
Fiat, A., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-47721-7_12 · Cited by 3,943
Short Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_30 · Cited by 2,993
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
Lower Bounds for Discrete Logarithms and Related Problems
Shoup, V. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-69053-0_18 · Cited by 1,229
The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
Bellare, M., & Rogaway, P. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68339-9_34 · Cited by 945
The Decision Diffie-Hellman problem
Boneh, D. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0054851 · Cited by 895
Efficient Identification and Signatures for Smart Cards
Schnorr, C. P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-46885-4_68 · Cited by 751
The random oracle methodology, revisited (preliminary version)
Canetti, R., Goldreich, O., & Halevi, S. (1998) · Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98 · doi:10.1145/276698.276741 · Cited by 715
Chaum, D., & van Antwerpen, H. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_20 · Cited by 605
American National Standard magnetic tape labels and file structure for information interchange
States, U. (1977) · doi:10.6028/nbs.fips.79 · Cited by 508
On the Exact Security of Full Domain Hash
Coron, J.-S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_14 · Cited by 347
A Proposal for an ISO Standard for Public Key Encryption.
Shoup, V. (2001) · Cited by 271
Optimal Security Proofs for PSS and Other Signature Schemes
Coron, J.-S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_18 · Cited by 215
RSA-OAEP Is Secure under the RSA Assumption
Fujisaki, E., Okamoto, T., Pointcheval, D., & Stern, J. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_16 · Cited by 206
Maurer, U. M., & Wolf, S. (2000) · Designs Codes and Cryptography · doi:10.1023/a:1008302122286 · Cited by 138
A Signature Scheme as Secure as the Diffie-Hellman Problem
Goh, E.-J., & Jarecki, S. (2003) · Lecture notes in computer science · doi:10.1007/3-540-39200-9_25 · Cited by 132
Design Validations for Discrete Logarithm Based Signature Schemes
Brickell, E. F., Pointcheval, D., Vaudenay, S., & Yung, M. M. (2000) · Lecture notes in computer science · doi:10.1007/978-3-540-46588-1_19 · Cited by 120
Cited by
Trapdoors for hard lattices and new cryptographic constructions
Gentry, C., Peikert, C., & Vaikuntanathan, V. (2008) · Proceedings of the fortieth annual ACM symposium on Theory of computing · doi:10.1145/1374376.1374407 · Cited by 2,435
Short Signatures Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_4 · Cited by 1,447
Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
Waters, B. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_36 · Cited by 919
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
Multi-signatures in the plain public-Key model and a general forking lemma
Bellare, M., & Neven, G. (2006) · Proceedings of the 13th ACM conference on Computer and communications security · doi:10.1145/1180405.1180453 · Cited by 654
Metadata
- Authors
- Katz, J., & Wang, N.
- Venue
- Proceedings of the 10th ACM conference on Computer and communications security
- Publisher
- ACM
- Published
- 2003-10-27
- Pages
- 155-164
- ISSN
- 1543-7221 (ISSN-L)
- OpenAlex
- W2132022887
- Cited by
- 285
- References
- 21
- FWCI
- 8.35
- Type
- conference paper
- Language
- en
- Open access
- closed
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.