The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups
Open accessOverview
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
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
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
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
Boneh, D., Boyen, X., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-28628-8_3 · Cited by 2,089
Self-citationElliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9780429466335 · Cited by 1,770
Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles
Boneh, D., & Boyen, X. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_14 · Cited by 1,766
Self-citationShort Signatures from the Weil Pairing
Boneh, D., Lynn, B., & Shacham, H. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0314-9 · Cited by 1,467
Self-citationShort 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
Self-citationLower 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
Reducing elliptic curve logarithms to logarithms in a finite field
Menezes, A. J., Okamoto, T., & Vanstone, S. A. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.259647 · Cited by 1,022
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73011 · Cited by 959
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
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
Pairing-Friendly Elliptic Curves of Prime Order
Barreto, P. S. L. M., & Naehrig, M. (2006) · Lecture Notes in Computer Science · doi:10.1007/11693383_22 · Cited by 877
Practical Identity-Based Encryption Without Random Oracles
Gentry, C. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_27 · Cited by 805
The Weil Pairing, and Its Efficient Calculation
Miller, V. S. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0315-8 · Cited by 578
Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security
Sahai, A. (2003) · 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) · doi:10.1109/sffcs.1999.814628 · Cited by 575
On the Security of Joint Signature and Encryption
An, J. H., Dodis, Y., & Rabin, T. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46035-7_6 · Cited by 571
An Efficient Signature Scheme from Bilinear Pairings and Its Applications
Zhang, F., Safavi-Naini, R., & Susilo, W. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24632-9_20 · Cited by 513
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
Efficient pairing computation on supersingular Abelian varieties
Barreto, P. S. L. M., Galbraith⋆, S. D., hÉigeartaigh, C. Ó., et al. (2007) · Designs Codes and Cryptography · doi:10.1007/s10623-006-9033-6 · Cited by 434
A Verifiable Random Function with Short Proofs and Keys
Dodis, Y., & Yampolskiy, A. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_28 · Cited by 428
Improved Online/Offline Signature Schemes
Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44647-8_21 · Cited by 384
Secure Hash-and-Sign Signatures Without the Random Oracle
Gennaro, R., Halevi, S., & Rabin, T. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_9 · Cited by 347
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
Signature schemes based on the strong RSA assumption
Cramer, R., & Shoup, V. (2000) · ACM Transactions on Information and System Security · doi:10.1145/357830.357847 · Cited by 325
Efficiency improvements for signature schemes with tight security reductions
Katz, J., & Wang, N. (2003) · Proceedings of the 10th ACM conference on Computer and communications security · doi:10.1145/948109.948132 · Cited by 285
Mitsunari, S., Sakai, R., & Kasahara, M. (2002) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · Cited by 279
Security Analysis of the Strong Diffie-Hellman Problem
Cheon, J. H. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_1 · Cited by 274
Separating Decision Diffie–Hellman from Computational Diffie–Hellman in Cryptographic Groups
Joux, A., & Nguyen, K. (2003) · Journal of Cryptology · doi:10.1007/s00145-003-0052-4 · Cited by 239
Collision-Resistant hashing: Towards making UOWHFs practical
Mihir Bellare, Y., & Rogaway, P. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052256 · Cited by 216
QUARTZ, 128-Bit Long Digital Signatures: http://www.minrank.org/quartz/
Patarin, J., Courtois, N., & Goubin, L. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_21 · Cited by 167
Efficient Pairing Computation on Supersingular Abelian Varieties.
Barreto, P. S. L. M., Galbraith⋆, S. D., O'hEigeartaigh, C., et al. (2004) · Cited by 83
Paterson, K. G. (2005) · Cambridge University Press eBooks · doi:10.1017/cbo9780511546570.012 · Cited by 67
On the Security of HFE, HFEv- and Quartz
Courtois, N. T., Daum, M., & Felke, P. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_25 · Cited by 64
Heß, F., Smart, N. P., & Vercauteren, F. (2006) · Cited by 12
Cited by
Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
Katz, J., Sahai, A., & Waters, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_9 · Cited by 1,081
Pseudonym Changing at Social Spots: An Effective Strategy for Location Privacy in VANETs
Lu, R., Lin, X., Luan, T. H., Liang, X., & Shen, X. (2012) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2011.2162864 · Cited by 455
Verifiable Delegation of Computation over Large Datasets
Benabbas, S., Gennaro, R., & Vahlis, Y. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_7 · Cited by 379
DeepCoin: A Novel Deep Learning and Blockchain-Based Energy Exchange Framework for Smart Grids
Ferrag, M. A., & Maglaras, L. (2020) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2019.2922936 · Cited by 358
Dynamic Audit Services for Outsourced Storages in Clouds
Zhu, Y., Ahn, G.-J., Hu, H., Yau, S. S., An, H. G., & Hu, C.-J. (2013) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.51 · Cited by 319
Metadata
- Authors
- Boneh, D., & Boyen, X.
- Venue
- Journal of Cryptology
- Published
- 2007-09-11
- Volume
- 21
- Issue
- 2
- Pages
- 149-177
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2057636642
- Cited by
- 605
- References
- 37
- FWCI
- 29.16
- Type
- journal article
- Language
- en
- Open access
- bronze
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.