收藏切换
Counter Overflow-Aware Optimization Technique for Secure Delayed Re-Encryption in Non-Volatile Memory
收藏切换
Hangyu Yan1, Renhai Chen1, *, Yu Zhang2, Wenyan Shi1, Hongyue Wu1, Zhiyong Feng1
Journal of Computer Research and Development | 2026, 63(9) : 2355 - 2370
Less
收藏切换
Journal of Computer Research and Development | 2026, 63(9): 2355-2370
• Network and Information Security •
Counter Overflow-Aware Optimization Technique for Secure Delayed Re-Encryption in Non-Volatile Memory
Full
Hangyu Yan1, Renhai Chen1, *, Yu Zhang2, Wenyan Shi1, Hongyue Wu1, Zhiyong Feng1
Affiliations
  • 1College of Intelligence and Computing, Tianjin University, Tianjin 300350
  • 2Department of Computer Science and Technology, Tsinghua University, Beijing 100084
  • born in 1999. Master. His main research interests include computer storage, artificial intelligence, and algorithm hardware acceleration

    born in 1987. PhD, associate professor. His main research interests include computer architecture, embedded systems, machine learning, artificial intelligence, communication, and transmission

    born in 2000. Master. His main research interests include computer storage and algorithm hardware acceleration

    born in 1991. Master. Her main research interests include time-series database, distributed storage, and computer architecture

    born in 1988. PhD, associate professor. His main research interests include service computing, mobile edge computing, and mobile cloud computing

    born in 1965. PhD, professor. His main research interests include software engineering, artificial intelligence, service computing, knowledge engineering, and computer cognition

About Author:

born in 1999. Master. His main research interests include computer storage, artificial intelligence, and algorithm hardware acceleration

born in 1987. PhD, associate professor. His main research interests include computer architecture, embedded systems, machine learning, artificial intelligence, communication, and transmission

born in 2000. Master. His main research interests include computer storage and algorithm hardware acceleration

born in 1991. Master. Her main research interests include time-series database, distributed storage, and computer architecture

born in 1988. PhD, associate professor. His main research interests include service computing, mobile edge computing, and mobile cloud computing

born in 1965. PhD, professor. His main research interests include software engineering, artificial intelligence, service computing, knowledge engineering, and computer cognition

Published: 2026-09-01 doi: 10.7544/issn1000-1239.202550462
Outline
收藏切换

Non-volatile memory (NVM), with the advantages of persistence after power failure, high density, and large capacity, has attracted extensive attention from both academia and industry. However, its persistence also makes NVM more vulnerable to security threats such as unauthorized access and data tampering. To ensure data confidentiality and integrity during storage and access, secure NVM systems generally employ encryption and integrity verification mechanisms. Nevertheless, directly applying these mechanisms to NVM may cause severe write amplification, resulting in increased write latency and energy consumption. To address this problem, we propose epoch-based re-encryption delay (ERED), including word-epoch-based re-encryption delay (W-ERED) and line-epoch-based re-encryption delay (L-ERED). Since the re-encryption frequency of a data line is usually dominated by its most frequently updated word, W-ERED introduces flag bits for local counters to identify frequently overflowing words. When a local counter overflows, only the overflowing word is re-encrypted with a new line counter, while non-overflowing words continue to use the old line counter, thereby avoiding unnecessary re-encryption operations. Based on this observation, L-ERED further exploits the fact that the re-encryption rate of a data page is mainly determined by the data line with the highest overflow frequency in that page. By introducing overflow flags for line counters, L-ERED ensures that only overflowing data lines are re-encrypted with the major counter upon overflow, thus significantly reducing the re-encryption granularity and overhead caused by line-counter overflow. Furthermore, to reduce write overhead and improve crash recovery capability, we propose an enhanced scheme, STAR+. STAR+ introduces a counter write-filtering mechanism that writes counters back to NVM only when the number of cache updates reaches a preset threshold, thereby reducing counter write operations. During crash recovery, STAR+ adopts the Osiris technique and uses shadow counters to record incremental updates. It reconstructs counter states by reading persisted counter values, replaying the logged increments, and verifying their correctness. In addition, STAR+ restores the integrity tree by updating the authentication values of leaf and parent nodes and recursively recalculating upper-level Hash values, thereby ensuring consistency between data and metadata. Experimental results show that, compared with SECRET, W-ERED reduces the average write bit-flip rate by 5%, write latency by 11%, and write energy by 6%, with only 8/512 additional storage overhead. In L-ERED, the number of re-encrypted lines is only 26.7% of that in BASE and 47.7% of that in RSR, with only 1/512 additional storage overhead. Moreover, compared with STAR, STAR+ reduces NVM writes by 9.8% and performance overhead by 3.1%, while achieving comparable recovery time.

non-volatile memory  /  data encryption  /  counter mode encryption  /  write optimization  /  crash consistency
延航宇, 陈仁海, 张雨, 史文燕, 吴洪越, 冯志勇. 计数器溢出可感知的非易失性存储器安全重加密延迟优化技术. 计算机研究与发展, 2026 , 63 (9) : 2355 -2370 . DOI: 10.7544/issn1000-1239.202550462
Hangyu Yan, Renhai Chen, Yu Zhang, Wenyan Shi, Hongyue Wu, Zhiyong Feng. Counter Overflow-Aware Optimization Technique for Secure Delayed Re-Encryption in Non-Volatile Memory[J]. Journal of Computer Research and Development, 2026 , 63 (9) : 2355 -2370 . DOI: 10.7544/issn1000-1239.202550462
Year 2026 volume 63 Issue 9
64
32
Cite this Article
BibTeX
Article Info
doi: 10.7544/issn1000-1239.202550462
  • Receive Date:2025-06-09
  • Online Date:2026-11-17
  • Published:2026-09-01
Article Data
Affiliations
History
  • Received:2025-06-09
  • Revised:2026-05-12
  • Accepted:2026-05-14
Affiliations
    1College of Intelligence and Computing, Tianjin University, Tianjin 300350
    2Department of Computer Science and Technology, Tsinghua University, Beijing 100084
References
Share
https://castjournals.cast.org.cn/joweb/jsjyjyfz/EN/10.7544/issn1000-1239.202550462
Share to
QR

Scan QR to access full text

Cite this article
BibTeX
Citations
表12种不同金属材料的力学参数
科
Family
属数
Number of
genus
种数
Number of
species
占总种数比例
Percentage of
total species (%)
属
Genus
种数
Number of
species
占总种数比例
Percentage of total
species (%)
鹅膏菌科Amanitaceae 2 11 5.26 鹅膏菌属 Amanita 10 4.78
小菇科 Mycenaceae 2 12 5.74 丝盖伞属 Inocybe 5 2.39
多孔菌科 Polyporaceae 8 14 6.70 蜡蘑属 Laccaria 5 2.39
红菇科 Russulaceae 3 23 11.00 小皮伞属 Marasmius 6 2.87
小菇属 Mycena 11 5.26
光柄菇属 Pluteus 5 2.39
红菇属 Russula 17 8.13
栓菌属 Trametes 5 2.39
关闭全屏
  • BibTeX
  • EndNote
  • RefWorks
  • TxT