The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Algorithmic Number Theory: 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000. Proceedings
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
Factorization in the Composition Algebras
Smith, D. A. (2000) · Lecture notes in computer science · doi:10.1007/10722028_35 · Cited by 2
Cited by
Evaluating 2-DNF Formulas on Ciphertexts
Boneh, D., Goh, E.-J., & Nissim, K. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30576-7_18 · Cited by 1,692
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Secure Conjunctive Keyword Search over Encrypted Data
Golle, P., Staddon, J., & Waters, B. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24852-1_3 · Cited by 773
Classical hardness of learning with errors
Brakerski, Z., Langlois, A., Peikert, C., Regev, O., & Stehlé, D. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488680 · Cited by 627
BKZ 2.0: Better Lattice Security Estimates
Chen, Y., & Nguyen, P. Q. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25385-0_1 · Cited by 598
Computationally Private Information Retrieval with Polylogarithmic Communication
Cachin, C., Micali, S., & Stadler, M. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_28 · Cited by 579
Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
Lyubashevsky, V. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_35 · Cited by 558
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
Fully Homomorphic Encryption over the Integers with Shorter Public Keys
Coron, J.-S., Mandal, A., Naccache, D., & Tibouchi, M. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_28 · Cited by 466
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
Stehlé, D., & Steinfeld, R. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_4 · Cited by 444
Shor's discrete logarithm quantum algorithm for elliptic curves
Proos, J., & Zalka, C. (2003) · Quantum Information and Computation · doi:10.26421/qic3.4-3 · Cited by 421
Gama, N., & Nguyen, P. Q. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_3 · Cited by 413
Universal Re-encryption for Mixnets
Golle, P., Jakobsson, M., Juels, A., & Syverson, P. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24660-2_14 · Cited by 412
Public Key Encryption with Conjunctive Keyword Search and Its Extension to a Multi-user System
Hwang, Y. H., & Lee, P. J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-73489-5_2 · Cited by 407
Attribute-Based Encryption with Partially Hidden Encryptor-Specified Access Structures
Nishide, T., Yoneyama, K., & Ohta, K. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68914-0_7 · Cited by 403
Quantum computation in brain microtubules? The Penrose–Hameroff ‘Orch OR‘ model of consciousness
Stuart, H. (1998) · Philosophical Transactions of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.1998.0254 · Cited by 361
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
Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
Güneysu, T., Lyubashevsky, V., & Pöppelmann, T. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33027-8_31 · Cited by 301
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Hierarchical Predicate Encryption for Inner-Products
Okamoto, T., & Takashima, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-10366-7_13 · Cited by 290
Public Key Cryptography in Sensor Networks—Revisited
Gaubatz, G., Kaps, J.-P., & Sunar, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30496-8_2 · Cited by 289
Lattice Enumeration Using Extreme Pruning
Gama, N., Nguyen, P. Q., & Regev, O. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-13190-5_13 · Cited by 284
Metadata
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1507575253
- Cited by
- 1,001
- References
- 1
- FWCI
- 52.27
- 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.