Focusing on the problem of high overhead and frequent overflow of the counter mode encryption, this paper proposed an efficient scheme to protect data confidentiality and integrity. Based on the local characteristic of data accessing, the scheme set different counter length for memory area according to different accessing frequencies and the counter length can be dynamically adjusted. The analysis and the simulation results indicated that compared with the counter mode encryption, the scheme can decrease memory space overhead and the number of overflow. The proposed scheme can be applied to other schemes of protecting confidentiality and integrity based on counters and can satisfy performance requirements for most applications.
SuhClarkeD.GassendB.van DijkM., and DevadasS.. Efficient memory integrity verification and encryption for secure processors. The 36th International Symposium on Microarchitecture, 2003, 12:339–350.
2.
GassendB.SuhG.ClarkeD.DijkM., and DevadasS.. Caches and Hash Trees for Efficient Memory Integrity Verification. In Proc of the 9th International Symposium on High Performance Computer Architecture (HPCA-9), 2003, 2: 295–306.
3.
ShiW.LeeH.-H.GhoshM.LuC., and BoldyrevaA.. High efficiency counter mode Security architecture via prediction and precomputation. The 32nd International Symposium on Computer Architecture, 2005, 6: 14–24.
4.
YanC.RogersB.EnglenderD.SolihinY., and PrvulovicM.. Improving cost, performance, and security of memory encryption and authentication. The 33rd annual international symposium on Computer Architecture, 2006, 9: 179–190.
5.
LuC.ZhangT.ShiW., and LeeH.-H. S.. M-Tree: A high efficiency security architecture for protecting integrity and privacy of software. Journal of Parallel and Distributed Computing, 2006, 66(9): 1116–1128.
RogersBrianChhabraSiddharthaSolihinYan and PrvulovicMilos. Using address independent seed encryption and bonsai merkle trees to make secure processors OS-and performance-friendly. The 40th Annual IEEE/ACM International Symposium Microarchitecture (MICRO-40), 2007, 12: 183–196.
8.
ElbazR.ChampagneD.LeeR.B.TorresL.SassatelliG.GuilleminP.TEC-Tree: A Low Cost and Parallelizable Tree for Efficient Defense against Memory Replay Attacks. In: Cryptographic Hardware and embedded systems (CHES), 2007:289–302
9.
LeeR. B.KwanP. C.McGregorJ. P.DwoskinJ.WangZ.. Architecture for protecting critical secrets in microporcessors. The International Symposium on Computer Architecture, 2005, 6: 2–13.
10.
ShiW.LeeH.-H.GhoshM., and LuC.. Architectural support for high speed protection of memory integrity and confidentiality in multiprocessor systems. The International Conference on Parallel Architectures and Compilation Techniques.2004, (9): 123–134.
11.
HuangR.DenD. Y., and SuhG. E.. Orthrus: Efficient software integrity protection on multi-cores. The 15th International Conference on Architectural Support for Programming Languages and Operating Systems, 2010, 3: 371–383.
12.
ZhangY.GaoL.YangJ.ZhangX., and GuptaR.. SENSS: Security enhancement to symmetric shared memory multiprocessors. In International Symposium on High-Performance Computer Architecture, 2005, 2: 352–362.
13.
LeeM.AhnM., and KimE.. I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems. In Proc.of the International Conference on Parallel Architectures and Compilation Techniques, 2007, 9: 94–103.
14.
RogersB.SolihinY., and PrvulovicM.. Efficient data protection for distributed shared memory multiprocessors. In International Conference on Parallel Architectures and Compilation Techniques, 2006, 9, 84–94.
15.
RogersBrianYanChenyuChhabraSiddhartha, Single-Level Integrity and Confidentiality Protection for Distributed Shared Memory Multiprocessors. In Proc. of the International Symposium on Computer Architecture, 2008, 2. 161–172.
16.
ShiW. and LeeH.-H.. Accelerating memory decryption and authentication with frequent value prediction. The 4th International Conference on Computing Frontiers (CF), 2007, 5: 35–45.
17.
SuhG. E.ClarkeD.GassendB.van DijkM., and DevadasS.. AEGIS: Architecture for tamper-evident and tamperresistant processing. The 17th annual international conference on Supercomputing, 2003, 6: 160–171.
18.
N. I. of Science and Technology. FIPS PUB 197: Advanced Encryption Standard (AES), November 2001.
19.
AustinTodd, Eric Larson, and Dan Ernst. SimpleScalar: An Infrastructure for Computer System Modeling. Computer, 35(2): 59–67, 2002.
20.
KleinOsowskiA.FlynnJ.MearesN., and LiljaD.. Adapting the spec 2000 benchmark suite for simulation-based computer architecture research. The Kluwer International Series in Engineering and Computer Science, 2001, 610: 83–100.
