Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 176

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron

Gao, Suo, Zhang, Zheyi, Li, Qi, Ding, Siqi, Iu, Herbert Ho-Ching, Cao, Yinghong, Xu, Xianying, Wang, Chunpeng, Mou, Jun · 2025 · IEEE Transactions on Dependable and Secure Computing

Abstract

Traditional video encryption methods protect video content by encrypting each frame individually. However, in resource-constrained environments, this approach consumes significant computational resources. To overcome this challenge, this paper proposes a novel method called “Encrypt a story (EAS)”, which aims to enhance encryption efficiency by focusing on encrypting specific segments of the video rather than encrypting each frame. The EAS refers to selecting segments in the time dimension of the video that contain important information or key events for encryption. This method leverages video segmentation techniques to focus encryption efforts on continuous key frames, significantly reducing the consumption of computational resources. To address the need for a large number of key streams during the encryption process, this paper proposes a discrete sinusoidal memristive Rulkov neuron map (DSM-RNM). Through attractor analysis, complexity comparison, Lyapunov exponent, and NIST tests, we validated its ability to generate high-performance pseudorandom sequences, which significantly enhances the security of the encryption algorithm. Notably, the DSM-RNM is shown to exhibit a phenomenon of infinitely coexisting attractors. Furthermore, by constructing a digital circuit to capture the attractors of the DSM-RNM, its potential for industrial applications is demonstrated. Evaluation results show that the EAS saves approximately 90% of the time while ensuring security, exhibiting strong practicality and efficiency

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tdsc.2025.3603570

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 45

  1. 10.1109/TDSC.2022.3228385 · doi:10.1109/tdsc.2022.3228385
  2. 10.1109/TDSC.2025.3542820 · doi:10.1109/tdsc.2025.3542820
  3. 10.1515/eng-2024-0051 · DOI
  4. 10.1109/TDSC.2022.3218570 · doi:10.1109/tdsc.2022.3218570
  5. 10.1109/TDSC.2023.3318975 · DOI
  6. 10.1016/j.chaos.2024.114681 · DOI
  7. 10.1016/j.apm.2024.06.016 · DOI
  8. 10.1109/JIOT.2024.3376572 · DOI
  9. 10.1631/jzus.A2300651 · DOI
  10. 10.1109/tcad.2025.3567878 · DOI
  11. 10.1109/JIOT.2024.3432494 · DOI
  12. 10.1109/TSMC.2024.3401412 · DOI
  13. 10.1016/j.physa.2019.122660 · DOI
  14. 10.1007/s11517-023-02925-9 · DOI
  15. 10.1007/s11071-023-08859-z · DOI
  16. 10.1063/5.0229908 · DOI
  17. 10.1016/j.eswa.2024.124891 · DOI
  18. 10.1007/s11071-024-10820-7 · doi:10.1007/s11071-024-10820-7
  19. 10.7498/aps.73.20240942 · DOI
  20. 10.1117/1.jei.33.1.013003 · DOI
  21. 10.1007/s11042-023-15593-6 · DOI
  22. 10.1007/s11071-025-11281-2 · DOI
  23. 10.1142/S0218127424500135 · DOI
  24. 10.1007/s11071-024-09368-3 · DOI
  25. 10.1063/5.0215152 · DOI
  26. 10.1109/TIE.2024.3417974 · DOI
  27. 10.3389/fphy.2022.911144 · DOI
  28. 10.1109/TCSII.2023.3293109 · DOI
  29. 10.1109/TIE.2023.3281687 · DOI · Paper page
  30. 10.1109/TIE.2023.3292857 · DOI
  31. 10.1103/PhysRevLett.86.183 · DOI · Paper page
  32. 10.1007/s11431-023-2432-1 · DOI
  33. 10.1016/j.chaos.2024.115517 · DOI
  34. 10.1142/S0218127424500688 · DOI
  35. 10.1007/s13042-024-02251-y · DOI
  36. Wu, 2011, NPCR and UACI randomness tests for image encryption, J. Sel. Areas Telecommun., 1, 31
  37. 10.1109/TCSI.2024.3407809 · DOI
  38. 10.1109/TCE.2023.3285626 · DOI
  39. 10.1109/TCYB.2024.3377011 · DOI · Paper page
  40. 10.1109/TCSI.2023.3296693 · DOI
  41. 10.1109/TNNLS.2023.3270563 · DOI
  42. 10.1109/TII.2022.3176054 · DOI
  43. 10.1109/TNNLS.2022.3146570 · DOI · Paper page
  44. 10.1109/TGCN.2021.3095707 · DOI
  45. 10.1109/TITS.2021.3129598 · DOI

Cited by

See all 176

Metadata

Authors
Gao, S., Zhang, Z., Li, Q., Ding, S., Iu, H. H.-C., Cao, Y., Xu, X., Wang, C., & Mou, J.
Venue
IEEE Transactions on Dependable and Secure Computing
Published
2025-11
Volume
22
Issue
6
Pages
8011-8024
ISSN
  • 1545-5971 (ISSN-L)
  • 1941-0018
  • 2160-9209
OpenAlex
W4413785573
Cited by
176
References
5
FWCI
64.40
Type
journal article
Language
en
Open access
closed
Funders
  • Liaoning Provincial Science and Technology Plan Joint Project (2024-MSLH-033)
  • Technological Innovation Projects in the Field of Artificial Intelligence in Liaoning Province (2023JH26/10300011)
  • Basic Scientific Research Projects in Department of Education of Liaoning Province (LJ212410152049)
  • Taishan Scholars Program of Shandong Province (tsqnz20250747)
  • National Natural Science Foundation of China (62502250, 62571079)

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: Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron. https://app.cochat.ai/papers/10.1109/tdsc.2025.3603570
The paper
Gao, S., Zhang, Z., Li, Q., Ding, S., Iu, H. H.-C., Cao, Y., Xu, X., Wang, C., & Mou, J. (2025). Encrypt a Story: A Video Segment Encryption Method Based on the Discrete Sinusoidal Memristive Rulkov Neuron. IEEE Transactions on Dependable and Secure Computing. https://doi.org/10.1109/tdsc.2025.3603570

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.