The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps
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
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
Self-citationIdentity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
Self-citationShort 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
Self-citationA 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
Rivest, R. L., Shamir, A., & Tauman, Y. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45682-1_32 · Cited by 1,619
Short 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-citationHierarchical ID-Based Cryptography
Gentry, C., & Silverberg, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_34 · Cited by 1,088
Self-citationA One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2000) · Lecture Notes in Computer Science · doi:10.1007/10722028_23 · Cited by 1,039
Boldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
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
Secure Border Gateway Protocol (S-BGP)
Kent, S., Lynn, C., & Seo, K. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839934 · Cited by 645
Toward Hierarchical Identity-Based Encryption
Horwitz, J., & Lynn, B. (2002) · Lecture notes in computer science · doi:10.1007/3-540-46035-7_31 · Cited by 584
Self-citationID-Based Blind Signature and Ring Signature from Pairings
Zhang, F., & Kim, K. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-36178-2_33 · Cited by 530
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
Optimistic fair exchange of digital signatures
Asokan, N., Shoup, V., & Waidner, M. (2000) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.839935 · Cited by 480
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
Okamoto, T., & Pointcheval, D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44586-2_8 · Cited by 477
A One Round Protocol for Tripartite Diffie–Hellman
Joux, A. (2004) · Journal of Cryptology · doi:10.1007/s00145-004-0312-y · Cited by 452
Threshold Ring Signatures and Applications to Ad-hoc Groups
Bresson, E., Stern, J., & Szydlo, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_30 · Cited by 311
Efficient and practical fair exchange protocols with off-line TTP
Bao, F., Deng, R. H., & Mao, W. (2002) · Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186) · doi:10.1109/secpri.1998.674825 · Cited by 295
Accountable-subgroup multisignatures: extended abstract
Micali, S., Ohta, K., & Reyzin, L. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502017 · Cited by 241
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
Naor, M. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_31 · Cited by 164
Abuse-Free Optimistic Contract Signing
Garay, J. A., Jakobsson, M., & MacKenzie, P. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_29 · Cited by 161
Fiat, A. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_17 · Cited by 156
A digital multisignature scheme using bijective public-key cryptosystems
Okamoto, T. (1988) · ACM Transactions on Computer Systems · doi:10.1145/48012.48246 · Cited by 145
Secure Border Gateway Protocol (Secure-BGP)
Kent, S., Lynn, C., & Seo, K. (2000) · Cited by 136
Micali, S. M., & Rivest, R. L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45760-7_16 · Cited by 127
Efficient Construction of (Distributed) Verifiable Random Functions
Dodis, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36288-6_1 · Cited by 122
Boldyreva, A. (2002) · Cited by 108
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Rabin, T., Jarecki, S., & Krawczyk, H. (2007) · Journal of Cryptology · doi:10.1007/s00145-007-0201-2 · Cited by 89
Robust and Efficient Sharing of RSA Functions
Gennaro, R., Rabin, T., Jarecki, S., & Krawczyk, H. (2000) · Journal of Cryptology · doi:10.1007/s001459910011 · Cited by 69
Poupard, G., & Stern, J. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45539-6_13 · Cited by 49
Cited by
Guide to Elliptic Curve Cryptography
(2004) · Springer Professional Computing · doi:10.1007/b97644 · Cited by 3,054
Provable data possession at untrusted stores
Ateniese, G., Burns, R., Curtmola, R., Herring, J., Kissner, L., Peterson, Z., & Song, D. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315318 · Cited by 2,705
Bitcoin and beyond: a technical survey on decentralized digital currencies
Tschorsch, F., & Scheuermann, B. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2535718 · Cited by 1,690
Enabling Public Auditability and Data Dynamics for Storage Security in Cloud Computing
Wang, Q., Wang, C., Ren, K., Lou, W., & Li, J. (2011) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2010.183 · Cited by 1,511
Improved proxy re-encryption schemes with applications to secure distributed storage
Ateniese, G., Fu, K., Green, M., & Hohenberger, S. (2006) · ACM Transactions on Information and System Security · doi:10.1145/1127345.1127346 · Cited by 1,475
“DEFINITIONS Our protocols are based on bilinear maps [Boneh and Franklin 2003; Boneh et al. 2001, 2003; Joux 2000], which we implemented using the fast Tate pairings [Galbraith et al. 2002].”
Method
Metadata
- Authors
- Boneh, D., Gentry, C., Lynn, B., & Shacham, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2003
- Pages
- 416-432
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1788452017
- Cited by
- 1,821
- References
- 32
- FWCI
- 38.79
- 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.