Memory Confidentiality and Integrity Protection Method Based on Variable Length Counter

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.

• Publication year

  2012

• Venue

  2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & Science

• Publication date

  2012-10-19

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1260/1748-3018.8.4.421
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Orthrus: efficient software integrity protection on multi-cores

  2010cited by this paper
• Single-level integrity and confidentiality protection for distributed shared memory multiprocessors

  2008cited by this paper
• Using Address Independent Seed Encryption and Bonsai Merkle Trees to Make Secure Processors OS- and Performance-Friendly

  2007cited by this paper
• I2SEMS: Interconnects-Independent Security Enhanced Shared Memory Multiprocessor Systems

  2007cited by this paper
• Accelerating memory decryption and authentication with frequent value prediction

  2007cited by this paper
• TEC-Tree: A Low-Cost, Parallelizable Tree for Efficient Defense Against Memory Replay Attacks

  2007cited by this paper
• M-TREE: A high efficiency security architecture for protecting integrity and privacy of software

  2006cited by this paper
• Improving Cost, Performance, and Security of Memory Encryption and Authentication

  2006cited by this paper
• Efficient data protection for distributed shared memory multiprocessors

  2006cited by this paper
• High efficiency counter mode security architecture via prediction and precomputation

  2005cited by this paper
• Architecture for protecting critical secrets in microprocessors

  2005cited by this paper
• SENSS: security enhancement to symmetric shared memory multiprocessors

  2005cited by this paper
• Parallelizable Authentication Trees

  2005cited by this paper
• Architectural support for high speed protection of memory integrity and confidentiality in multiprocessor systems

  2004cited by this paper
• Caches and hash trees for efficient memory integrity verification

  2003cited by this paper
• Efficient memory integrity verification and encryption for secure processors

  2003influential reference
• AEGIS: architecture for tamper-evident and tamper-resistant processing

  2003cited by this paper
• SimpleScalar: An Infrastructure for Computer System Modeling

  2002cited by this paper
• Adapting the SPEC 2000 benchmark suite for simulation-based computer architecture research

  2001cited by this paper

• Tree Technology for Memory Confidentiality Integrity Protection

  2018cites this paper
• S Developing Configurable Security Algorithms for Embedded System Storage

  2015cites this paper