The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Compact Multi-signatures for Smaller Blockchains
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
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
Self-citationEfficient signature generation by smart cards
Schnorr, C. P. (1991) · Journal of Cryptology · doi:10.1007/bf00196725 · Cited by 2,787
Security Arguments for Digital Signatures and Blind Signatures
Pointcheval, D., & Stern, J. (2000) · Journal of Cryptology · doi:10.1007/s001450010003 · Cited by 2,209
A Digital Signature Based on a Conventional Encryption Function
Merkle, R. C. (1988) · Lecture Notes in Computer Science · doi:10.1007/3-540-48184-2_32 · Cited by 1,998 · cited 1×
“The other schemes support threshold signatures using Merkle trees [37] as outlined in [35, Sec.”
MethodAggregate and Verifiably Encrypted Signatures from Bilinear Maps
Boneh, D., Gentry, C., Lynn, B., & Shacham, H. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-39200-9_26 · Cited by 1,821
Self-citationBoldyreva, A. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36288-6_3 · Cited by 1,006
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
Self-citationSequential Aggregate Signatures and Multisignatures Without Random Oracles
Lu, S., Ostrovsky, R., Sahai, A., Shacham, H., & Waters, B. (2006) · Lecture Notes in Computer Science · doi:10.1007/11761679_28 · Cited by 355
Sequential Aggregate Signatures from Trapdoor Permutations
Lysyanskaya, A., Micali, S., Reyzin, L., & Shacham, H. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_5 · Cited by 311
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
Boldyreva, A., Gentry, C., O'Neill, A., & Yum, D. H. (2007) · Proceedings of the 14th ACM conference on Computer and communications security · doi:10.1145/1315245.1315280 · Cited by 174
The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
Ristenpart, T., & Yilek, S. (2007) · Lecture notes in computer science · doi:10.1007/978-3-540-72540-4_13 · Cited by 166
Li, C.-M., Hwang, T., & Lee, N.-Y. (1995) · Lecture notes in computer science · doi:10.1007/bfb0053435 · Cited by 119
A digital multisignature scheme based on the Fiat-Shamir scheme
Ohta, K., & Okamoto, T. (1993) · Lecture notes in computer science · doi:10.1007/3-540-57332-1_11 · Cited by 104
Synchronized aggregate signatures
Ahn, J. H., Green, M., & Hohenberger, S. (2010) · Proceedings of the ACM Conference on Computer and Communications Security · doi:10.1145/1866307.1866360 · Cited by 99
Efficient Sequential Aggregate Signed Data
Neven, G. (2008) · Springer eBooks · doi:10.1007/978-3-540-78967-3_4 · Cited by 71
Self-citationAn Efficient Lattice-Based Multisignature Scheme with Applications to Bitcoins
Bansarkhani, R. E., & Sturm, J. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-48965-0_9 · Cited by 63
Efficient discrete logarithm based multi-signature scheme in the plain public key model
Ma, C., Weng, J., Li, Y., & Deng, R. H. (2009) · Designs Codes and Cryptography · doi:10.1007/s10623-009-9313-z · Cited by 56
A Unified Framework for Trapdoor-Permutation-Based Sequential Aggregate Signatures
Gentry, C., O’Neill, A., & Reyzin, L. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-76581-5_2 · Cited by 18
Cited by
Blockchain Security: A Survey of Techniques and Research Directions
Leng, J., Zhou, M., Zhao, J. L., Huang, Y., & Bian, Y. (2022) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2020.3038641 · Cited by 279
Survey: sharding in blockchains
Yu, G., Wang, X., Yu, K., Ni, W., Zhang, J. A., & Liu, R. P. (2020) · IEEE Access · doi:10.1109/access.2020.2965147 · Cited by 267
“Initially, ByzCoin [63] was the first scalable consensus protocol that combines PoW and BFT algorithms in a treebased structure, by means of scalable collective signing (CoSi) [76], [77].”
BackgroundMethodInfluentialSoK of used cryptography in blockchain
Raikwar, M., Gligoroski, D., & Kralevska, K. (2019) · IEEE Access · doi:10.1109/access.2019.2946983 · Cited by 153
Short Threshold Dynamic Group Signatures
Camenisch, J., Drijvers, M., Lehmann, A., Neven, G., & Towa, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-57990-6_20 · Cited by 59
Self-citation
Metadata
- Authors
- Boneh, D., Drijvers, M., & Neven, G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer International Publishing
- Published
- 2018
- Pages
- 435-464
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2811448169
- Cited by
- 299
- References
- 19
- FWCI
- 8.22
- 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.