The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
jPBC: Java pairing based cryptography
Abstract
It has been recently discovered that some cyclic groups that could be used in Cryptography admit a special bilinear pairing map that introduces extra structure to the group. Bilinear pairing maps were first used to break cryptosystems (see, for example, ) and later it was realized that the extra structure could be exploited to build cryptosystems with extra properties. Boneh and Franklins identity-based encryption scheme is the most famous early example of what could be achieved using bilinear maps. After that, a plethora of cryptosystems have been designed using bilinear maps. No full and freely available implementation of pairing based cryptography was available until this work. Recent proposals fall short of this goal as either their source code is not available or because they support a limited range of elliptic curve. Moreover, neither one of implements preprocessing that is crucial to reduce the computation time. In this work, we present jPBC a Java port of the PBC library written in C. jPBC provides a full ecosystem of interfaces and classes to simplify the use of the bilinear maps even for a non-cryptographer. jPBC supports different types of elliptic curves, preprocessing which can speedup the computation significantly and it is ready for the mobile world. Moreover a benchmark comparison between jPBC and PBC has been performed to measure the gap between the two libraries. Furthermore jPBC has been benchmarked on different Android mobile platforms.
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
Identity-Based Encryption from the Weil Pairing
Boneh, D., & Franklin, M. (2003) · SIAM Journal on Computing · doi:10.1137/s0097539701398521 · Cited by 3,528
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
Elliptic Curves in Cryptography
Blake, I. F., Seroussi, G., & Smart, N. P. (1999) · Cambridge University Press eBooks · doi:10.1017/cbo9781107360211 · Cited by 1,828
Efficient Identity Based Signature Schemes Based on Pairings
Hess, F. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36492-7_20 · Cited by 840
Galbraith, S. D., Paterson, K. G., & Smart, N. P. (2008) · Discrete Applied Mathematics · doi:10.1016/j.dam.2007.12.010 · Cited by 794
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
A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
Frey, G., & Ruck, H.-G. (1994) · Mathematics of Computation · doi:10.2307/2153546 · Cited by 551
New Explicit Conditions of Elliptic Curve Traces for FR-Reduction
Miyaji, A., Nakabayashi, M., & Takano, S. (2001) · Institutional Repositories DataBase (IRDB) · Cited by 509
Identity-based authenticated key agreement protocol based on Weil pairing
Smart, N. P. (2002) · Electronics Letters · doi:10.1049/el:20020387 · Cited by 446
ID-based signatures from pairingson elliptic curves
Paterson, K. G. (2002) · Electronics Letters · doi:10.1049/el:20020682 · Cited by 366
Cited by
Mamta, Gupta, B. B., Li, K.-C., Leung, V. C. M., Psannis, K. E., & Yamaguchi, S. (2021) · IEEE/CAA Journal of Automatica Sinica · doi:10.1109/jas.2021.1004003 · Cited by 292
A Privacy-Aware Authentication Scheme for Distributed Mobile Cloud Computing Services
Tsai, J.-L., & Lo, N.-W. (2015) · IEEE Systems Journal · doi:10.1109/jsyst.2014.2322973 · Cited by 292
Collaborative and secure sharing of healthcare data in multi-clouds
Fabian, B., Ermakova, T., & Junghanns, P. (2015) · Information Systems · doi:10.1016/j.is.2014.05.004 · Cited by 223
Cherbal, S., Zier, A., Hebal, S., Louail, L., & Annane, B. (2024) · The Journal of Supercomputing · doi:10.1007/s11227-023-05616-2 · Cited by 152
Privacy-Preserving Aggregation for Federated Learning-Based Navigation in Vehicular Fog
Kong, Q., Yin, F., Lu, R., Li, B., Wang, X., Cui, S., & Zhang, P. (2021) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2021.3075683 · Cited by 102
Metadata
- Authors
- De Caro, A., & Iovino, V.
- Venue
- 2011 IEEE Symposium on Computers and Communications (ISCC)
- Publisher
- IEEE
- Published
- 2011-06
- Pages
- 850-855
- ISSN
- 1530-1346 (ISSN-L)
- OpenAlex
- W2139910984
- Cited by
- 703
- References
- 15
- FWCI
- 7.29
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: jPBC: Java pairing based cryptography. https://app.cochat.ai/papers/10.1109/iscc.2011.5983948
- The paper
- De Caro, A., & Iovino, V. (2011). jPBC: Java pairing based cryptography. 2011 IEEE Symposium on Computers and Communications (ISCC). https://doi.org/10.1109/iscc.2011.5983948
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.