Survey on cyberspace security
The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
Ciphertext-Policy Attribute-Based Encryption
Bethencourt, J., Sahai, A., & Waters, B. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.11 · Cited by 5,131
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
PRESENT: An Ultra-Lightweight Block Cipher
Bogdanov, A., Knudsen, L. R., Leander, G., Paar, C., Poschmann, A., Robshaw, M. J. B., Seurin, Y., & Vikkelsoe, C. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_31 · Cited by 2,867
On lattices, learning with errors, random linear codes, and cryptography
Regev, O. (2009) · Journal of the ACM · doi:10.1145/1568318.1568324 · Cited by 2,315
The OAuth 2.0 Authorization Framework
(2012) · doi:10.17487/rfc6749 · Cited by 1,383
Cited by
GIFT: A Small Present: Towards Reaching the Limit of Lightweight Encryption
Banik, S., Pandey, S. K., Peyrin, T., Sasaki, Y., Sim, S. M., & Todo, Y. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-66787-4_16 · Cited by 388
Lightweight Cryptography: A Solution to Secure IoT
Dhanda, S. S., Singh, B., & Jindal, P. (2020) · Wireless Personal Communications · doi:10.1007/s11277-020-07134-3 · Cited by 294
A review of lightweight block ciphers
Hatzivasilis, G., Fysarakis, K., Papaefstathiou, I., & Manifavas, C. (2018) · Journal of Cryptographic Engineering · doi:10.1007/s13389-017-0160-y · Cited by 259
Security Vulnerabilities of SGX and Countermeasures: A Survey
Fei, S., Yan, Z., Ding, W., & Xie, H. (2022) · ACM Computing Surveys · doi:10.1145/3456631 · Cited by 122
Metadata
- Authors
- Zhang, H., Han, W., Lai, X., Lin, D., Ma, J., & Li, J.
- Venue
- Science China Information Sciences
- Published
- 2015-11
- Volume
- 58
- Issue
- 11
- Pages
- 1-43
- ISSN
- 1869-1919 (ISSN-L)
- 1674-733X
- OpenAlex
- W2278507260
- Cited by
- 208
- References
- 11
- FWCI
- 32.23
- Type
- journal article
- 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: Survey on cyberspace security. https://app.cochat.ai/papers/10.1007/s11432-015-5433-4
- The paper
- Zhang, H., Han, W., Lai, X., Lin, D., Ma, J., & Li, J. (2015). Survey on cyberspace security. Science China Information Sciences. https://doi.org/10.1007/s11432-015-5433-4
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.